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

Jérôme Durand-Lose (1)

1 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

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.

Keywords: Abstract geometrical computation; Black hole model; Energy conservation; Reversibility; Signal machine

Domains: Logic in Computer Science [cs.LO]; Other [cs.OH]

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⟩