429 search results - page 41 / 86 » Turing computations on ordinals |
111
click to vote
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We show that the family of tree languages recognized by weak alternating automata is closed by three set theoretic operations that correspond to sum, multiplication by ordinals <...
UC
2009
Springer
15 years 6 months ago
2009
Springer
Geometrical Computation and Computable Analysis J´erˆome Durand-Lose⋆ Laboratoire d’Informatique Fondamentale d’Orl´eans, Universit´e d’Orl´eans, B.P. 6759, F-45067 OR...
IJBC
2007
14 years 11 months ago
2007
A Chaitin Omega number is the halting probability of a universal prefix-free Turing machine. Every Omega number is simultaneously computably enumerable (the limit of a computable...
112
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
FUNGAMES
2008
15 years 27 days ago
2008
Recent developments in computer science introduce and discuss new concepts for computation beyond universal Turing machines. Quantum computing relates to new insights in quantum ph...