Survey of Recursion Theory
We have developed recursion theory as much as we need for our later purposes in logic. But in this chapter we want to survey, without proofs, some further topics. Most of these topics are also frequently useful in logical investigations.
KeywordsWord Problem Turing Machine Initial Segment Recursive Function Diophantine Equation
Unable to display preview. Download preview PDF.
- 5.Hermes, H. Enumerability, Decidability, Computability. New York: Springer (1969).Google Scholar