Turing computations on ordinals

We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite set of ordinal parameters if and only if it is an element of G

• Type: Journal
• Year: 2005
• Where: BSL
• Authors: Peter Koepke
• Keywords: Arbitrary Ordinal Length, BSL 2005, Ordinal Computability, Standard Turing Computability