2956 articles  [version française]
HAL: hal-00511224, version 1

Short view  Export this paper
Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation
Durand-Lose J.
International Journal of Unconventional Computing 8, 1 (2012) 33-46 - http://hal.archives-ouvertes.fr/hal-00511224
Article in peer-reviewed journal
Computer Science/Computational Complexity
Computer Science/Logic in Computer Science
Abstract geometrical computation 6: a reversible, conservative and rational based model for black hole computation
Jérôme Durand-Lose () 1
1:  Laboratoire d'Informatique Fondamentale d'Orléans (LIFO)
http://www.univ-orleans.fr/lifo/
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges
Batiment IIIA 6 Rue Léonard de Vinci - BP 6759 45067 ORLEANS CEDEX 2
France
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.
English

International Journal of Unconventional Computing
Publisher Old City Publishing
ISSN 1548-7199 (eISSN : 1548-7202)
international
2012
8
1
33-46

Abstract geometrical computation – Black hole model – Energy conservation – Reversibility – Signal machine

Project Id AGAPE
Year 2009
Project title Algorithmes de Graphes à Paramètre fixe et Exponentiels exacts
Acronyme ANR Blanc AGAPE
Attached file list to this document: 
PDF
2010_IJUC_UC_HC.pdf(287.6 KB)