3028 articles  [english version]
HAL : hal-00511224, version 1

Fiche détaillée  Récupérer au format
International Journal of Unconventional Computing 8, 1 (2012) 33-46
Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation
Jérôme Durand-Lose 1
(2012)

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.
1 :  Laboratoire d'Informatique Fondamentale d'Orléans (LIFO)
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges
Informatique/Complexité

Informatique/Logique en informatique
Abstract geometrical computation – Black hole model – Energy conservation – Reversibility – Signal machine
Liste des fichiers attachés à ce document : 
PDF
2010_IJUC_UC_HC.pdf(287.6 KB)