Talk:Computability

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.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

High

This article has been rated as High-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

proposal[edit]

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)[reply]

The reorganization is underway. Centralized discussion is at Talk:Recursion theory#Reorganize the Computability articles. — Carl (CBM · talk) 14:55, 22 August 2009 (UTC)[reply]

revisions[edit]

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)[reply]

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)[reply]

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)[reply]

The redirect "Computable"[edit]

I 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)[reply]