429 search results - page 18 / 86 » Turing computations on ordinals |
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
Computability concerns information with a causal – typically algorithmic – structure. As such, it provides a schematic analysis of many naturally occurring situations. We look ...
APAL
2010
14 years 9 months ago
2010
Computability theory concerns information with a causal
77
Voted
TCS
2010
14 years 4 months ago
2010
MFCS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. A binary sequence A = A(0)A(1) . . . is called infinitely often (i.o.) Turing-autoreducible if A is reducible to itself via an oracle Turing machine that never queries it...
AAAI
1994
14 years 11 months ago
1994
The Turing Test was proposed by Alan Turing in 1950; he called it the Imitation Game. In 1991 Hu Loebner prize competition, offering a f h Loebner started the 100,000 prize to the...