Robust simulations of turing machines with analytic maps and flows

Authors:
Daniel S. Graça;Manuel L. Campagnolo;Jorge Buescu
Affiliations:
Departamento de Matemática, Faculdade de Ciências e Tecnologia, Universidade do Algarve, Faro, Portugal;Center for Logic and Computation, Departamento de Matemática, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisboa, Portugal;Center for Mathematical Analysis, Geometry and Dynamical Systems, Departamento de Matemática, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisboa, Portugal
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 12
Cited 10

Computability with low-dimensional dynamical systems

Theoretical Computer Science
Universal computation and other capabilities of hybrid and continuous dynamical systems

Theoretical Computer Science - Special issue on hybrid systems
On the computational power of neural nets

Journal of Computer and System Sciences
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines

Theoretical Computer Science - Special issue on real numbers and computers
Correction to proof that recurrent neural networks can robustly recognize only regular languages

Neural Computation
On the effect of analog noise in discrete-time analog computations

Neural Computation
Iteration, inequalities, and differentiability in analog computers

Journal of Complexity
An analog characterization of the Grzegorczyk hierarchy

Journal of Complexity
The Complexity of Real Recursive Functions

UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Analog computers and recursive functions over the reals

Journal of Complexity
Real recursive functions and their hierarchy

Journal of Complexity
The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction

Neural Computation

A note on discreteness and virtuality in analog computing

Theoretical Computer Science
Computability of analog networks

Theoretical Computer Science
Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs

Electronic Notes in Theoretical Computer Science (ENTCS)
Reachability in Linear Dynamical Systems

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Computing Omega-Limit Sets in Linear Dynamical Systems

UC '08 Proceedings of the 7th international conference on Unconventional Computing
Robust computations with dynamical systems

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The general purpose analog computer and computable analysis are two equivalent paradigms of analog computation

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A survey of recursive analysis and Moore's notion of real computation

Natural Computing: an international journal
Delta-Decidability over the Reals

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Computation with perturbed dynamical systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we show that closed-form analytic maps and flows can simulate Turing machines in an error-robust manner. The maps and ODEs defining the flows are explicitly obtained and the simulation is performed in real time.