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 ...

Reversible programming languages and computing represent a forward‐looking paradigm in which every computational operation is designed to be invertible. In these systems, each transition from one ...

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 ...