Notes on the history of reversible computation
IBM Journal of Research and Development
Reversible parallel computation: an evolving space-model
Theoretical Computer Science
Ininvertible cellular automata: a review
Physica D
Computation-universality of one-dimensional one-way reversible cellular automata
Information Processing Letters
Reversibility and surjectivity problems of cellular automata
Journal of Computer and System Sciences
Reversible simulation of one-dimensional irreversible cellular automata
Theoretical Computer Science
Universality of a reversible two-counter machine
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
Reversible simulation of irreversible computation
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Collision-based computing
Computing inside the billiard ball model
Collision-based computing
Collision-based computing
Computing with solitons: a review and prospectus
Collision-based computing
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
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
Logical reversibility of computation
IBM Journal of Research and Development
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
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
| Hi-index | 0.00 |
In Abstract geometrical computation for black hole computation (MCU '04, LNCS 3354), the author provides a setting based on rational numbers, abstract geometrical computation, with super-Turing capability. In the present paper, we prove the Turing computing capability of reversible conservative abstract geometrical computation. Reversibility allows backtracking as well as saving energy; it corresponds here to the local reversibility of collisions. Conservativeness corresponds to the preservation of another energy measure ensuring that the number of signals remains bounded. We first consider 2-counter automata enhanced with a stack to keep track of the computation. Then we built a simulation by reversible conservative rational signal machines.