New Computational Paradigms

DOI10.1007/B136981MaRDI QIDQ5717028zbMATH OpenOpenAlexFDO

Authors Jérôme O. Durand-Lose

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136981

zbMATH Keywords

Abstract geometrical computationAnalog model of computationCellular automatageometryTuring universality

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

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
• Machines, Computations, and Universality

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: New Computational Paradigms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5717028)