429 search results - page 1 / 86 » Turing computations on ordinals |
BSL
2005
13 years 4 months 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
13 years 10 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...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounde...
CIE
2005
Springer
13 years 10 months ago
2005
Springer
• We produce a classification of the pointclasses of sets of reals produced by infinite time turing machines with 1-tape. The reason for choosing this formalism is that it appa...
CIE
2009
Springer
13 years 11 months ago
2009
Springer
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...