Talk:Computability
 | This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
proposal
editBased on a discussion at talk:recursion theory, I'd like to expand this into a top-level overview of models of computation, algorithms, etc. — Carl (CBM · talk) 11:00, 14 August 2009 (UTC)
- The reorganization is underway. Centralized discussion is at Talk:Recursion theory#Reorganize the Computability articles. — Carl (CBM · talk) 14:55, 22 August 2009 (UTC)
revisions
editI have started the process of moving the focus of this article from automata to computability in general. I changed the lede and the first couple sections; over time I will work through the rest of it. Please feel free to help, and to improve anything I have written. — Carl (CBM · talk) 15:18, 22 August 2009 (UTC)
Fiefdom fights
editI've moved this out of the lead, and rewrote it, but frankly these fiefdom fights don't really belong in an introductory article. It should be mentioned at computability theory if at all. There's some discussion on this with references at the (old) page on Talk:Recursion_theory#Concrete_proposal. Pcap ping 17:05, 22 August 2009 (UTC)
- Thanks CBM for removing it altogether, and adding this instead to the lead, which is what an uninvolved reader should be let know. Pcap ping 17:15, 22 August 2009 (UTC)
The redirect "Computable"
editI don't think "Computable" should redirect here - I think it would be better to have a disambiguation page, with links to computable set, computable real, computable function, etc. --Jordan Mitchell Barrett (talk) 11:53, 30 April 2021 (UTC)