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

Revision as of 11:26, 14 August 2009

Latest revision as of 05:04, 13 July 2024

(2 intermediate revisions by one other user not shown)

Line 1:

{{tpr}}

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

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

==Untitled==

__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

Line 297 ⟶ 296:

There is a discussion currently at [[Talk:Recursion theory#Reorganize the Computability articles]] about reorganising the computability articles to get some sort of hierarchy. In particular the thinking is that [[Computability]] should be an introduction rather than a disambiguation page. [[User:Dmcq|Dmcq]] ([[User talk:Dmcq|talk]]) 11:26, 14 August 2009 (UTC)

:The reorganization is underway. The centralized discussion is at [[Talk:Recursion theory#Reorganize the Computability articles]]. &mdash;&nbsp;Carl <small>([[User:CBM|CBM]]&nbsp;·&nbsp;[[User talk:CBM|talk]])</small> 14:52, 22 August 2009 (UTC)