Abstract geometrical computation. III: Black holes for classical and analog computing
From MaRDI portal
Publication:734212
DOI10.1007/s11047-009-9117-0zbMath1192.68275OpenAlexW2149320870MaRDI QIDQ734212
Publication date: 19 October 2009
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-009-9117-0
analog computationarithmetic hierarchyabstract geometrical computationZeno phenomenonblack hole modelhyper-computingMalament-Hogarth space-time
Related Items
Abstract geometrical computation. VIII: Small machines, accumulations \& rationality ⋮ Abstract geometrical computation. IV: Small Turing universal signal machines ⋮ Abstract geometrical computation. V: Embedding computable analysis ⋮ A universal oracle for signal machines ⋮ Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversible parallel computation: An evolving space-model
- A new conceptual framework for analog computation
- Euclidean geometry in terms of automata theory
- A result about the power of geometric oracle machines
- Achilles and the tortoise climbing up the hyper-arithmetical hierarchy
- Some bounds on the computational power of piecewise constant derivative systems
- Analytic machines
- \(\mu\)-recursion and infinite limits.
- Analog computation beyond the Turing limit
- Relativistic computers and the Turing barrier
- On the Computational Capabilities of Several Models
- A Survey of Infinite Time Turing Machines
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Infinite time Turing machines
- Deciding Arithmetic Using SAD Computers
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- The Extent of Computation in Malament–Hogarth Spacetimes
- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
- (Short) Survey of Real Hypercomputation
- Logical Approaches to Computational Barriers
- Theory and Applications of Models of Computation
- Non-Turing computations via Malament--Hogarth space-times