Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal

Jérôme Durand-Lose

Open source

DOI
10.1007/11780342_18
Published
2006
Container
Lecture Notes in Computer Science
Publisher
Springer Berlin Heidelberg
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/11780342_18,
  title = {Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal},
  author = {Jérôme Durand-Lose},
  year = {2006},
  journal = {Lecture Notes in Computer Science},
  doi = {10.1007/11780342_18},
  url = {https://doi.org/10.1007/11780342_18}
}

RIS

TY  - JOUR
TI  - Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
AU  - Jérôme Durand-Lose
PY  - 2006
JO  - Lecture Notes in Computer Science
DO  - 10.1007/11780342_18
UR  - https://doi.org/10.1007/11780342_18
ER  - 

APA

Durand-Lose, J. (2006). Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal. Lecture Notes in Computer Science. https://doi.org/10.1007/11780342_18

Source records