429 search results - page 14 / 86 » Turing computations on ordinals |
CF
2005
ACM
14 years 11 months ago
2005
ACM
We survey results of a quarter century of work on computation by reversible general-purpose computers (in this setting Turing machines), and general reversible simulation of irrev...
158
click to vote
APAL
2011
14 years 4 months ago
2011
The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are indepe...
AML
2010
14 years 9 months ago
2010
Defining the degree of categoricity of a computable structure M to be the least degree d for which M is d-computably categorical, we investigate which Turing degrees can be realiz...
100
click to vote
CIE
2009
Springer
15 years 4 months ago
2009
Springer
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular pro...
BSL
2005
14 years 9 months ago
2005
A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if every member of Q Turing computes a member of P. We say that P i...