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.
Our interest in the questions addressed in this paper was raised by past discussions with Félix Costa and Cris Moore. This work was partially supported by Fundaçã o para a Ciência e a Tecnologia (FCT) and FEDER via the Center for Logic and Computation – CLC, the project ConTComp POCTI/MAT/45978/2002 and grant SFRH/BD/17436/2004. Additional support was also provided by the Fundaçã o Calouste Gulbenkian through the Programa Gulbenkian de Estímulo à Investigaçã o.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Moore, C.: Unpredictability and undecidability in dynamical systems. Phys. Rev. Lett. 64, 2354–2357 (1990)
Koiran, P., Cosnard, M., Garzon, M.: Computability with low-dimensional dynamical systems. Theoret. Comput. Sci. 132, 113–128 (1994)
Siegelmann, H.T., Sontag, E.D.: On the computational power of neural networks. J. Comput. System Sci. 50, 132–150 (1995)
Moore, C.: Finite-dimensional analog computers: Flows, maps, and recurrent neural networks. In: Calude, C., Casti, J., Dinneen, M. (eds.) 1st International Conference on Unconventional Models of Computation - UMC 1998, pp. 59–71. Springer, Heidelberg (1998)
Casey, M.: The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Comp. 8, 1135–1178 (1996)
Casey, M.: Correction to proof that recurrent neural networks can robustly recognize only regular languages. Neural Comp. 10, 1067–1069 (1998)
Maass, W., Orponen, P.: On the effect of analog noise in discrete-time analog computations. Neural Comput. 10, 1071–1095 (1998)
Pour-El, M.B., Richards, J.I.: The wave equation with computable initial data such that its unique solution is not computble. Adv. Math. 39, 215–239 (1981)
Pour-El, M.B., Zhong, N.: The wave equation with computable initial data whose unique solution is nowhere computable. Math. Log. Quart. 43, 499–509 (1997)
Weihrauch, K., Zhong, N.: Is wave propagation computable or can wave computers beat the Turing machine? Proc. London Math. Soc. 85, 312–332 (2002)
Koiran, P., Moore, C.: Closed-form analytic maps in one and two dimensions can simulate universal Turing machines. Theoret. Comput. Sci. 210, 217–223 (1999)
Branicky, M.S.: Universal computation and other capabilities of hybrid and continuous dynamical systems. Theoret. Comput. Sci. 138, 67–100 (1995)
Campagnolo, M.L., Moore, C., Costa, J.F.: An analog characterization of the Grzegorczyk hierarchy. J. Complexity 18, 977–1000 (2002)
Mycka, J., Costa, J.F.: Real recursive functions and their hierarchy. J. Complexity 20, 835–857 (2004)
Campagnolo, M.L., Moore, C., Costa, J.F.: Iteration, inequalities, and differentiability in analog computers. J. Complexity 16, 642–660 (2000)
Campagnolo, M.L.: The complexity of real recursive functions. In: Calude, C.S., Dinneen, M.J., Peper, F. (eds.) UMC 2002. LNCS, vol. 2509, pp. 1–14. Springer, Heidelberg (2002)
Hirsch, M.W., Smale, S.: Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, London (1974)
Guckenheimer, J., Holmes, P.: Nonlinear Oscillations, Dynamical Systems, and Bifurcation of Vector Fields. Springer, Heidelberg (1983)
Viana, M.: Dynamical systems: moving into the next century. In: Engquist, B., Schmid, W. (eds.) Mathematics Unlimited - 2001 and Beyond, pp. 1167–1178. Springer, Heidelberg (2001)
Pilyugin, S.Y.: Shadowing in Dynamical Systems. Springer, Heidelberg (1999)
Grebogi, C., Poon, L., Sauer, T., Yorke, J., Auerbach, D.: Shadowability of chaotic dynamical systems. In: Handbook of Dynamical Systems, vol. 2, pp. 313–344. Elsevier, Amsterdam (2002)
Atkinson, K.E.: An Introduction to Numerical Analysis, 2nd edn. John Wiley & Sons, Chichester (1989)
Graça, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. J. Complexity 19, 644–664 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graça, D.S., Campagnolo, M.L., Buescu, J. (2005). Robust Simulations of Turing Machines with Analytic Maps and Flows. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_21
Download citation
DOI: https://doi.org/10.1007/11494645_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26179-7
Online ISBN: 978-3-540-32266-5
eBook Packages: Computer ScienceComputer Science (R0)