Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer

DOI10.1007/978-3-642-38236-9_16zbMath1382.68067arXiv1203.4667OpenAlexW3099579506MaRDI QIDQ4922124

Amaury Pouly, Olivier Bournez, Daniel Silva Graça

Publication date: 28 May 2013

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

Full work available at URL: https://arxiv.org/abs/1203.4667

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Computation over the reals, computable analysis (03D78)

Related Items (1)

Computable analysis with applications to dynamic systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classical recursion theory. The theory of functions and sets of natural numbers
• Analog computers and recursive functions over the reals.
• A theory of complexity for continuous time systems
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Computability with polynomial differential equations
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Building Infinite Machines
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• On the complexity of solving initial value problems
• Mathematical Theory of the Differential Analyzer
• Achilles and the tortoise climbing up the arithmetical hierarchy
• The stability of saturated linear dynamical systems is undecidable

This page was built for publication: Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer