Content deleted Content added
Sorry, this article is extremely poor and lacks basic connection with other models of computations, like recursion theory; downgrading to Start class |
tpr |
||
| (3 intermediate revisions by 2 users not shown) | |||
Line 1:
{{tpr}}
==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
Line 293 ⟶ 292:
This is a duplicate post from [[Talk:Algorithm#A_paradoxical_situation]]. To keep the discussion in one place, please comment there is you are interested. — Carl <small>([[User:CBM|CBM]] · [[User talk:CBM|talk]])</small> 20:43, 19 March 2008 (UTC)
== Reorganize the Computability articles ==
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]]. — Carl <small>([[User:CBM|CBM]] · [[User talk:CBM|talk]])</small> 14:52, 22 August 2009 (UTC)
| |||