 |
|
|
|
| HAL: hal-00511224, version 1 |
| Detailed view |  Export this paper |
|
|
| International Journal of Unconventional Computing to appear (2012) ?? |
|
|
|
|
| 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 |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Computational Complexity Computer Science/Logic in Computer Science |
|
|
| Abstract geometrical computation – Black hole model – Energy conservation – Reversibility – Signal machine |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00511224, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00511224 | |
| oai:hal.archives-ouvertes.fr:hal-00511224 | |
| From: Jérôme Durand-Lose | |
| Submitted on: Tuesday, 5 July 2011 15:45:43 | |
| Updated on: Monday, 16 January 2012 15:27:19 | |
