Sciweavers

93
Voted
CIE
2005
Springer
15 years 2 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