Elementary recursive and primitive recursive functions
Part of the Graduate Texts in Mathematics book series (GTM, volume 37)
To show that many number-theoretic functions are Turing computable, it is convenient to distinguish some functions by closure conditions.
KeywordsElementary Function Effective Function Recursive Function Finite Sequence Recursive Definition
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag Inc. 1976