C1 Admin
Posts : 1611 Join date : 20091019
 Subject: Mathematics' Shortcoming? (Kurt Godel) Wed 18 May 2011, 7:37 pm  
 First topic message reminder :By the 1928 international congress of mathematicians Hilbert "made his questions quite precise. http://en.wikipedia.org/wiki/Turing_machine+ First, was mathematics complete ...
+ Second, was mathematics consistent ...
+ And thirdly, was mathematics decidable?" (Hodges p. 91, Hawking p. 1121). The first two questions were answered in 1930 by Kurt Gödel at the very same meeting where Hilbert delivered his retirement speech (much to the chagrin of Hilbert); the third "the Entscheidungs problem" had to wait until the mid1930s. Emil Post developed his definition of a worker moving from room to room writing and erasing marks per a list of instructions (Post 1936), as did Princeton professor Church and his two students Stephen Kleene and J. B. Rosser by use of Church's lambdacalculus and Gödel's recursion theory (1934). Church's paper (published 15 April 1936) showed that the Entscheidungs problem was indeed "undecidable" and beat Turing to the punch by almost a year (Turing's paper submitted 28 May 1936, published January 1937). Hence, the answer to all three of the above questions is "NO". Funny we didn't learn this in school _________________ "For every thousand hacking at the leaves of evil, there is one striking at the root."David Thoreau (18171862)
Last edited by C1 on Tue 04 Dec 2012, 3:58 pm; edited 1 time in total 
