Higher Type Recursion for Transfinite Machine Theory

摘要

We look at some preliminary work in the theory of trans-finite Turing machines generalised in the manner of Kleene to higher type recursion theory. The underlying philosophy is that ordinary Turing computability and inductive definability is replaced by the example here of Infinite Time Turing Machine computability and quasi-inductive definability.