Editing Computability theory (section)

== Further reading ==
; Undergraduate level texts
* {{cite book |author-link=S. Barry Cooper |author-first=S. Barry |author-last=Cooper |title=Computability Theory |publisher=[[Chapman & Hall]]/CRC |date=2004 |isbn=1-58488-237-9}}
* {{cite book |author-first=Yuri Vladimirovich |author-last=Matiyasevich |author-link=Yuri Vladimirovich Matiyasevich |title=Hilbert's Tenth Problem |publisher=[[MIT Press]] |date=1993 |isbn=0-262-13295-8}}

; Advanced texts
* {{cite book |author-first1=Sanjay |author-last1=Jain<!-- most probably this one: https://web.archive.org/web/20220807102226/https://www.comp.nus.edu.sg/cs/people/sanjay/ --> |author-first2=Daniel Nathan |author-last2=Osherson |author-link2=Daniel Nathan Osherson |author-first3=James S. |author-last3=Royer |author-first4=Arun |author-last4=Sharma |author-link4=Arun Sharma (computer scientist) |title=Systems that learn: an introduction to learning theory |edition=2nd |publisher=[[Bradford Book]] / [[MIT Press]] |date=1999 |isbn=0-262-10077-0 |lccn=98-34861}}
* {{cite book |author-first=Manuel |author-last=Lerman |title=Degrees of unsolvability |publisher=[[Springer-Verlag]] |date=1983 |isbn=3-540-12155-2 |series=Perspectives in Mathematical Logic}}
* {{cite book |author-first=André |author-last=Nies |title=Computability and Randomness |publisher=[[Oxford University Press]] |date=2009 |isbn=978-0-19-923076-1}}
* {{cite book |author-link=Piergiorgio Odifreddi |author-first=Piergiorgio |author-last=Odifreddi |title=Classical Recursion Theory |publisher=[[North-Holland]] |date=1989 |isbn=0-444-87295-7 |url-access=registration |url=https://archive.org/details/classicalrecursi0000odif}}
* {{cite book |author-link=Piergiorgio Odifreddi |author-first=Piergiorgio |author-last=Odifreddi |title=Classical Recursion Theory |volume=II |publisher=[[Elsevier]] |date=1999 |isbn=0-444-50205-X}}

; Survey papers and collections
* {{cite book |author-first=Herbert Bruce |author-last=Enderton |author-link=Herbert Bruce Enderton |chapter=Elements of Recursion Theory |editor-first=Jon |editor-last=Barwise |editor-link=Jon Barwise |title=Handbook of Mathematical Logic |publisher=[[North-Holland]] |date=1977 |isbn=0-7204-2285-X |pages=[https://archive.org/details/handbookofmathem0090unse/page/527 527–566] |chapter-url=https://archive.org/details/handbookofmathem0090unse/page/527}}

; Research papers and collections
* {{cite journal |author-last1=Burgin |author-first1=Mark |author-last2=Klinger |author-first2=Allen |title=Experience, Generations, and Limits in Machine Learning |journal=[[Theoretical Computer Science (journal)|Theoretical Computer Science]] |issn= |volume=317 |issue=1–3 |pages=71–91 |date=2004 |doi=10.1016/j.tcs.2003.12.005 |doi-access=}}
* {{cite journal |author-first=Richard M. |author-last=Friedberg |author-link=Richard M. Friedberg |title=Three theorems on recursive enumeration: I. Decomposition, II. Maximal Set, III. Enumeration without repetition |journal=[[The Journal of Symbolic Logic]] |issn= |volume=23 |issue=3 |pages=309–316 |date=1958 |jstor=2964290 |doi=10.2307/2964290 |s2cid=25834814}}
* {{Cite journal |author-last=Gold |author-first=E. Mark |author-link=E. Mark Gold |title=Language Identification in the Limit |volume=10 |issue=5 |pages=447–474 |url=http://web.mit.edu/~6.863/www/spring2009/readings/gold67limit.pdf |journal=[[Information and Control]] |issn= |date=1967 |doi=10.1016/s0019-9958(67)91165-5 |doi-access=free}} [https://web.archive.org/web/20090125120159/http://www.isrl.uiuc.edu/~amag/langev/paper/gold67limit.html]
* {{cite journal |author-first=Carl Groos Jr. |author-last=Jockusch |author-link=Carl Groos Jockusch Jr. |title=Semirecursive sets and positive reducibility |journal=[[Transactions of the American Mathematical Society]] |issn= |volume=137 |issue=2 |pages=420–436 |date=1968 |jstor=1994957 |doi=10.1090/S0002-9947-1968-0220595-7 |doi-access=free}}
* {{cite journal |author-first1=Stephen Cole |author-last1=Kleene |author-link1=Stephen Cole Kleene |author-first2=Emil Leon |author-last2=Post |author-link2=Emil Leon Post |title=The upper semi-lattice of degrees of recursive unsolvability |journal=[[Annals of Mathematics]] |issn= |series=Series 2 |volume=59 |issue=3 |pages=379–407 |date=1954 |jstor=1969708 |doi=10.2307/1969708}}
* {{cite journal |author-first=John R. Sr. |author-last=Myhill |author-link=John R. Myhill Sr. |date=1956 |title=The lattice of recursively enumerable sets |journal=[[The Journal of Symbolic Logic]] |issn= |volume=21 |pages=215–220 |doi=10.1017/S002248120008525X |s2cid=123260425}}
* {{cite journal |author-first=Emil Leon |author-last=Post |author-link=Emil Leon Post |title=Recursive unsolvability of a problem of Thue |journal=[[Journal of Symbolic Logic]] |issn= |volume=12 |issue=1 |pages=1–11 |date=1947 |jstor=2267170 |doi=10.2307/2267170 |s2cid=30320278}} Reprinted in {{harvnb|Davis|1965}}.