Talk:Computability theory (computer science): Difference between revisions

Revision as of 11:26, 14 August 2009

Revision as of 14:50, 22 August 2009

Line 1:

{{WikiProject Computing|class=Start|importance=}}

{{WikiProject Computer science|class=Start|importance=top}}

__TOC__

I believe the Entscheidungsproblem was first proved unsolvable by Church, and months later by Turing. Goedel's theorems don't really talk about algorithms, so they don't directly apply. Of course, Goedel's trick of Goedel numbering and the Barber paradox is really the key to the Entscheidungsproblem and halting problem, everything else is details. --AxelBoldt