457 search results - page 5 / 92 » Hypercomputation: computing more than the Turing machine |
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We define a new transfinite time model of computation, infinite time cellular automata. The model is shown to be as powerful than infinite time Turing machines, both on finite and ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
70
Voted
ECCC
2002
14 years 9 months ago
2002
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
BIRTHDAY
2008
Springer
14 years 11 months ago
2008
Springer
The Church-Turing Thesis has been the subject of many variations and interpretations over the years. Specifically, there are versions that refer only to functions over the natural ...
103
click to vote
FORMATS
2006
Springer
15 years 1 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...