429 search results - page 3 / 86 » Turing computations on ordinals |
APAL
2011
13 years 24 days ago
2011
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
TCS
2012
12 years 1 months ago
2012
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
ICIP
2005
IEEE
14 years 7 months ago
2005
IEEE
In this paper we introduce a block-based approach for ordinal co-occurrence matrices aimed at improving robustness of the basic ordinal co-occurrence. Earlier, we have introduced t...
WOLLIC
2007
Springer
13 years 12 months ago
2007
Springer
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
AMC
2006
13 years 5 months ago
2006
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...