A reversible and conservative model based on rational signal machines for Black hole computation

Abstract : In the context of Abstract geometrical computation, it has been proved that black hole model (and SAD computers) can be implemented. To be more physic-like, it would be interesting that the construction is reversible and preserves some energy. There is already a (energy) conservative and reversible two-counter automaton simulation. In the present paper, based on reversible and conservative stacks, reversible Turing machines are simulated. Then a shrinking construction that preserves these properties is presented. All together, a black hole model implementation that is reversible and conservative (both the shrinking structure and the universal Turing machine) is provided.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00483710
Contributor : Jérôme Durand-Lose <>
Submitted on : Sunday, May 16, 2010 - 7:14:40 PM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Identifiers

  • HAL Id : hal-00483710, version 1

Collections

Citation

Jérôme Durand-Lose. A reversible and conservative model based on rational signal machines for Black hole computation. HyperNet 10: The Unconventional Computation 2010 (UC '10) Hypercomputation Workshop, Jun 2010, Japan. ⟨hal-00483710⟩

Share

Metrics

Record views

57