Theorem 8.2.1: the composition of partial (total) Turing-computable functions yields a partial (total) Turing-computable function.
Theorem 8.2.2: primitive recursion applied to total Turing-computable functions yields a total Turing-computable function.
Theorem, 8.2.3: the minimalization of a total Turing-computable function is a (partial) Turing-computable function.
Theorem 8.2.4: each (partial) recursive function on Nat is (partial) Turing-computable.
Previous slide | Next slide | Back to first slide | View graphic version |