Revision as of 14:52, 22 August 2009 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →Reorganize the Computability articles: note ← Previous edit		Latest revision as of 05:04, 13 July 2024 edit undo Jlwoodwa (talk \| contribs) Autopatrolled, Administrators 106,316 edits tpr
Line 1: {{tpr}} ~~__TOC__~~ ==Untitled== 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

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