
Computability theory
- Genres
- Recursion theory
- Author
- Herbert B. Enderton
- Pages
- 192
Where to find it
Some links are affiliate links: if you buy, the site may receive a commission at no extra cost to you.
Similar titles
How to Think About Algorithms (2008)
Fundamentals of mathematical logic (2005)
Higher recursion theory (1990)
Computability, enumerability, unsolvability (1996)
Recursion-theoretic hierarchies (1978)
Computable Analysis (2000)
Recursion Theory Week (1990)
Transtheoretic foundations of mathematics (general summary of results) (1997)