Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines

09/30/2021
by   Daniel S. Graça, et al.
0

In this paper, we analyze the problem of finding the minimum dimension n such that a closed-form analytic map/ordinary differential equation can simulate a Turing machine over ℝ^n in a way that is robust to perturbations. We show that one-dimensional closed-form analytic maps are sufficient to robustly simulate Turing machines; but the minimum dimension for the closed-form analytic ordinary differential equations to robustly simulate Turing machines is two, under some reasonable assumptions. We also show that any Turing machine can be simulated by a two-dimensional C^∞ ordinary differential equation on the compact sphere 𝕊^2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2017

An algorithm to simulate alternating Turing machine in signal machine

Geometrical Computation as a new model of computation is the counterpart...
research
02/19/2019

Continuous Ordinary Differential Equations and Infinite Time Turing Machines

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), w...
research
02/19/2019

Continuous Ordinary Differential Equations and Ordinal Time Turing Machines

We consider Continuous Ordinary Differential Equations (CODE) y'=f(y), w...
research
06/21/2022

D-CIPHER: Discovery of Closed-form PDEs

Closed-form differential equations, including partial differential equat...
research
01/31/2017

'Viral' Turing Machines, Computation from Noise and Combinatorial Hierarchies

The interactive computation paradigm is reviewed and a particular exampl...
research
02/11/2019

A Turing machine simulation by P systems without charges

It is well known that the kind of P systems involved in the definition o...

Please sign up or login with your details

Forgot password? Click here to reset