The axiomatic treatment of the computational complexity of partial recursive functions initiated by Blum is extended to relatively computable functions (as computed, for example, by Turing machines ...
The paper is mainly an expository account of elementary recursion theory. In part I, some care is given to the discussion of the relationship between the mathematical concepts of recursive functions ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback