429 search results - page 5 / 86 » Turing computations on ordinals |
68
Voted
CIE
2006
Springer
15 years 1 months ago
2006
Springer
Wegner and Eberbach[Weg04b] have argued that there are fundamental limitations to Turing Machines as a foundation of computability and that these can be overcome by so-called super...
MSCS
2006
14 years 9 months ago
2006
It is shown that for any 2-computably enumerable Turing degree l, any computably enumerable degree a, and any Turing degree s, if l = 0 , l < a, s 0 , and s is c.e. in a, then...
CIE
2006
Springer
15 years 1 months ago
2006
Springer
We introduce two hierarchies of unknown ordinal height. The hierarchies are induced by natural fragments of a calculus based on finite types and G
CMS
2006
14 years 11 months ago
2006
Abstract. Completely Automated Public Turing Test to tell Computers and Humans Apart (CAPTCHA) is a
APAL
2006
14 years 9 months ago
2006
Abstract. We show that the identity bounded Turing degrees of computably enumerable sets are not dense.