Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation - Archive ouverte HAL Access content directly
Journal Articles International Journal of Unconventional Computing Year : 2012

Abstract geometrical computation 6: a reversible, conservative and rational based model 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.
Fichier principal
Vignette du fichier
2010_IJUC_UC_HC.pdf (129.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00511224 , version 1 (05-07-2011)

Identifiers

  • HAL Id : hal-00511224 , version 1

Cite

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⟩
97 View
93 Download

Share

Gmail Facebook X LinkedIn More