242 search results - page 18 / 49 » Zigzags in Turing Machines |
SOFSEM
2001
Springer
14 years 3 days ago
2001
Springer
The class of weak parallel machines is interesting, because it contains some realistic parallel machine models, especially suitable for pipelined computations. We prove that a modi...
AB
2008
Springer
14 years 2 months ago
2008
Springer
We explore the computational power of biochemistry with respect to basic chemistry, identifying complexation as the basic mechanism that distinguishes the former from the latter. W...
CIE
2005
Springer
14 years 1 months ago
2005
Springer
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length ω to computations on tapes of arbitrary ordinal length. The general...
IJBC
2007
13 years 7 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...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Well-known hierarchies discriminate between the computational power of discrete time and space dynamical systems. A contrario the situation is more confused for dynamical...