Category talk:Computability theory

This category 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

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}}

Should we merge Category:Recursion with Category:Recursion theory?

71.109.149.180 (talk) 05:25, 10 October 2010 (UTC) Should we merge Category:Recursion with Category:Recursion theory?71.109.149.180 (talk) 05:27, 10 October 2010 (UTC)[reply]

recursion

"Recursion theory" is simply a synonym for "computability theory". Now some computable functions are defined by recursion. But recursion theory is not the study of recursion, nor is it a subtopic of recursion, and most things in recursion theory have nothing to do with recursion. The two topics are sometimes related but are otherwise distinct fields of inquiry. — Carl (CBM · talk) 02:46, 8 October 2009 (UTC)[reply]

Change in terminology: "recursive" to "computable"

There was consensus on the WikiProject Math (discussion here) that "computable" is a preferable alternative to the outdated, ambiguous "recursive" (in reference to computability/recursion theory). Therefore, articles in this category should generally use the term "computable X" rather than "recursive X". Exceptions should be made when "recursive" is still the popular name for the concept, e.g. Primitive recursive, μ-recursive, Kleene's recursion theorem. --Jordan Mitchell Barrett (talk) 22:51, 26 April 2021 (UTC)[reply]