Reversible parallel computation: an evolving space-model
Theoretical Computer Science
On optimal solutions to the firing squad synchronization problem
Theoretical Computer Science - Special issue on universal machines and computations
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy
Theoretical Computer Science - Special issue on real numbers and computers
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
Generation of Primes by a One-Dimensional Real-Time Iterative Array
Journal of the ACM (JACM)
Minds and Machines
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Achilles and the Tortoise Climbing Up the Arithmetical Hierarchy
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Cellular Automata: A Discrete Universe
Cellular Automata: A Discrete Universe
Computation: finite and infinite machines
Computation: finite and infinite machines
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Abstract Geometrical Computation and Computable Analysis
UC '09 Proceedings of the 8th International Conference on Unconventional Computation
Abstract geometrical computation 3: black holes for classical and analog computing
Natural Computing: an international journal
Geometrical accumulations and computably enumerable real numbers
UC'11 Proceedings of the 10th international conference on Unconventional computation
Hi-index | 0.00 |
The Black hole model of computation provides super-Turing computing power since it offers the possibility to decide in finite (observer's) time any recursively enumerable (R.E.) problem. In this paper, we provide a geometric model of computation, conservative abstract geometrical computation, that, although being based on rational numbers (and not real numbers), has the same property: it can simulate any Turing machine and can decide any R.E. problem through the creation of an accumulation. Finitely many signals can leave any accumulation, and it can be known whether anything leaves. This corresponds to a black hole effect.