Reversible conservative rational abstract geometrical computation is Turing-universal - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Reversible conservative rational abstract geometrical computation is Turing-universal

Abstract

In Abstract geometrical computation for black hole computation (MCU '04, LNCS 3354), the author provides a setting based on rational numb ers, abstract geometrical computation, with super-Turing capability. In the present paper, we prove the Turing computing capability of reversible conservative abstract geometrical computation. Reversibility allows backtracking as well as saving energy; it corresponds here to the local reversibility of collisions. Conservativeness corresponds to the preservation of another energy measure ensuring that the number of signals remains bounded. We first consider 2-counter automata enhanced with a stack to keep track of the computation. Then we built a simulation by reversible conservative rational signal machines.
Fichier principal
Vignette du fichier
2006_CiE.pdf (176.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00079687 , version 1 (12-02-2017)

Identifiers

Cite

Jérôme Durand-Lose. Reversible conservative rational abstract geometrical computation is Turing-universal. 2nd Conference on Computability in Europe (CiE '06), Jun 2006, Swansea, United Kingdom. pp.163-172, ⟨10.1007/11780342_18⟩. ⟨hal-00079687⟩
127 View
110 Download

Altmetric

Share

Gmail Facebook X LinkedIn More