Abstract geometrical computation 6: a reversible, conservative and rational based model 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.

Mots clés: Abstract geometrical computation; Black hole model; Energy conservation; Reversibility; Signal machine

Domaines: Complexité [cs.CC]; Logique en informatique [cs.LO]

Jérôme Durand-Lose. Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation. International Journal of Unconventional Computing, 2012, 8 (1), pp.33-46. ⟨hal-00511224⟩