Abstract geometrical computation. V: Embedding computable analysis
From MaRDI portal
Publication:1761691
DOI10.1007/s11047-010-9229-6zbMath1330.68075OpenAlexW2081323939MaRDI QIDQ1761691
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-010-9229-6
analog computationcomputable analysissignal machineabstract geometrical computationtype-2 Turing machine
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Abstract geometrical computation. 11: Slanted firing squad synchronisation on signal machines ⋮ Abstract geometrical computation. VII: Geometrical accumulations and computably enumerable real numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Abstract geometrical computation. IV: Small Turing universal signal machines
- Abstract geometrical computation. III: Black holes for classical and analog computing
- Analytic machines
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Abstract Geometrical Computation and Computable Analysis
- On the definitions of computable real continuous functions
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
- (Short) Survey of Real Hypercomputation
- Non-Turing computations via Malament--Hogarth space-times
This page was built for publication: Abstract geometrical computation. V: Embedding computable analysis
