Jérôme Durand-Lose. Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. In Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker, editors, Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings. Volume 3988 of Lecture Notes in Computer Science, pages 163-172, Springer, 2006. [doi]
@inproceedings{Durand-Lose06,
title = {Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal},
author = {Jérôme Durand-Lose},
year = {2006},
doi = {10.1007/11780342_18},
url = {http://dx.doi.org/10.1007/11780342_18},
researchr = {https://researchr.org/publication/Durand-Lose06},
cites = {0},
citedby = {0},
pages = {163-172},
booktitle = {Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings},
editor = {Arnold Beckmann and Ulrich Berger and Benedikt Löwe and John V. Tucker},
volume = {3988},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-35466-2},
}