Sciweavers

BSL
2005
74views more  BSL 2005»
13 years 11 months ago
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 ...
Peter Koepke
CIE
2005
Springer
14 years 5 months ago
Computing a Model of Set Theory
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
Peter Koepke