From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computer science  
WikiProject icon This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.


Based 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)


I 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[edit]

I'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)