BSL
2005
14 years 11 days ago
2005
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 ...
CIE
2005
Springer
14 years 6 months ago
2005
Springer
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...