< Earlier Kibitzing · PAGE 11 OF 11 ·
|Nov-03-10|| ||HeMateMe: He did his PhD at Cambridge University (I think, while still a teenager) on finite H spaces.|
Just a snippet her, on the topic:
"The mathematical concept of a <Hilbert space>, named after David Hilbert, generalizes the notion of Euclidean space. It extends the methods of vector algebra and calculus from the two-dimensional Euclidean plane and three-dimensional space to spaces with any finite or infinite number of dimensions. A Hilbert space is an abstract vector space possessing the structure of an inner product that allows length and angle to be measured. In addition, Hilbert spaces are required to be complete, a property that stipulates the existence of enough limits in the space to allow the techniques of calculus to be used.
Hilbert spaces arise naturally and frequently in mathematics, physics, and engineering, typically as infinite-dimensional function spaces. The earliest Hilbert spaces were studied from this point of view in the first decade of the 20th century by David Hilbert, Erhard Schmidt, and Frigyes Riesz. They are indispensable tools in the theories of partial differential equations, quantum mechanics, Fourier analysis (which includes applications to signal processing and heat transfer) and ergodic theory which forms the mathematical underpinning of the study of thermodynamics. <John von Neumann> coined the term "Hilbert space" for the abstract concept underlying many of these diverse applications. The success of Hilbert space methods ushered in a very fruitful era for functional analysis. Apart from the classical Euclidean spaces, examples of Hilbert spaces include spaces of square-integrable functions, spaces of sequences, Sobolev spaces consisting of generalized functions, and Hardy spaces of holomorphic functions."
....ok, thats all fine and well. But, I think he should have chosen a more challenging topic, like R + minor piece + P endgames, with pawns on both sides of the board.
|Nov-06-10|| ||Sastre: 'John Nunn wins World Problem Solving Championship' - http://www.chessbase.com/newsdetail....|
|Nov-06-10|| ||Shams: <Sastre> I find it amusing that in his bio on this page it states "In 2004 he won the World Problem Solving Championship." Doesn't he win it pretty much every year he enters?|
|Nov-06-10|| ||Sastre: According to Wikipedia he also won it in 2004 and 2007.|
|Dec-01-10|| ||anandrulez: http://kottke.org/10/03/magnus-carl...-|
championSPIEGEL: How that?
Carlsen: At the age of 15, Nunn started studying mathematics in Oxford; he was the youngest student in the last 500 years, and at 23 he did a PhD in algebraic topology. He has so incredibly much in his head. Simply too much. His enormous powers of understanding and his constant thirst for knowledge distracted him from chess.
|Dec-01-10|| ||M.D. Wilson: Broken link|
|Apr-25-11|| ||haydn20: <HeMateMe> I think you are confusing Hilbert spaces with H-spaces (named after the mathematician Hopf). H-spaces are used in the study of group representations. Hilbert spaces have, as you note, numerous apps because their structure admits doing calculus. H-spaces don't have that kind of structure.|
|Apr-25-11|| ||SamAtoms1980: Happy birthday!
Keep puzzling and perplexing us every Christmas!
|Apr-25-11|| ||wordfunph: In "John Nunn's Best Games", GM Nunn did not include his win against Karpov at Rotterdam 1989 because Karpov committed a serious error in time-trouble.|
happy birthday Doc!
|Apr-25-11|| ||HeMateMe: One of the better authors in chess, may you get a star named after you.|
|Apr-25-11|| ||MaxxLange: And get a haircut, you look like my Granny|
|Apr-25-11|| ||haydn20: PS I can't find anything about current math activity. He seems to be pretty fully occupied with chess. He is doing data-mining for chess table-bases, which is applied math in a way.|
|Aug-22-11|| ||Blunderdome: Today's QOTD:
"I am constantly astonished at how often tournament organisers invite noted draw specialists to their event, and then throw up their hands in horror at the number of quick draws that ensue." - John Nunn
But, he has 211 draws in 20 moves or less in the database. That's over 13% of his games.
Does he consider himself one of the noted specialists?
|Aug-22-11|| ||whiteshark: Thanks, <Blunderdome>!|
Who would have thought it?
Always suspect those who scream the loudest ... :D
|Aug-22-11|| ||perfidious: <wordfunph: In "John Nunn's Best Games", GM Nunn did not include his win against Karpov at Rotterdam 1989 because Karpov committed a serious error in time-trouble...>|
I'll bet Reshevsky would have, though-victories over the very strongest players appeared to be a chief criterion in his selection of games.
<HeHateMe> Nunn is an outstanding author and anything of his is worth reading.
|Aug-22-11|| ||wordfunph: i read somewhere that John Nunn's most irritating opponent was a German who ate sausage at the board, funny lol!|
|Aug-25-11|| ||hedgeh0g: It's quite apt that Nunn became so proficient in problem-solving, considering that many of his most well-known games contained problem-like winning shots. A great tactician with a few too many draws to his name.|
|Oct-19-11|| ||Korifej: Carlsen once said that Nunn not become worl champ. because he is to smart for playing chess (something like that)|
|Nov-18-11|| ||ControlledDemolition: His barnet is terrible; unkempt collar-length white hair reminds one of <David Icke>.|
|Mar-20-12|| ||whiteshark: Quote of the Day
< Chess is to a considerable extent about <pattern recognition>. The more patterns you have firmly fixed in your memory, the more effective you are likely to be at the chessboard.>
|Mar-20-12|| ||haydn20: <whiteshark> Nunn shd know about pattern recognition. IMO it is the single most important factor in mathematical ability. If you can recognize patterns, logic and computation (which most students think math is) are relatively easy to learn.|
|Apr-25-12|| ||talisman: happy birthday John.|
|Apr-25-13|| ||brankat: Best wishes for Your Birthday GM Nunn!|
|Dec-02-13|| ||Candide1966: John Nunn reports that he and Graham Burgess were the main targets of a kind of dirty war within Batsford, about the publisher's declining standards.|
|Dec-03-13|| ||Candide1966: "As an ecologist with limited spare time, I consider one hundred pages perfectly adequate for any Batsford book. Ray’s 'Dynamic Chess Openings' exhausted its subject in eighty-eight. Inferior authors would have padded the book, but Ray just moved on to a new one. Anybody who wants longer or better books at the same price has only to look elsewhere, though I could name several Batsford volumes which have been researched, and I am told that one recent title was proof-read."|
< Earlier Kibitzing · PAGE 11 OF 11 ·