Abstract geometrical computation: Turing-computing ability and undecidability
From MaRDI portal
Recommendations
- Abstract geometrical computation. I: Embedding black hole computations with rational numbers
- Ways to compute in Euclidean frameworks
- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
- Abstract Geometrical Computation and Computable Analysis
- Abstract geometrical computation for black hole computation (extended abstract)
Cited in
(8)- Pictures worth a thousand tiles, a geometrical programming language for self-assembly
- Ways to compute in Euclidean frameworks
- Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
- Multi-resolution cellular automata for real computation
- A Survey on Analog Models of Computation
- The Geometry of Computation-Graph Abstraction
- Logical Approaches to Computational Barriers
- Abstract geometrical computation. IV: Small Turing universal signal machines
This page was built for publication: Abstract geometrical computation: Turing-computing ability and undecidability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717028)