Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
The Church-Turing thesis states that any sufficiently powerful computational model which captures the notion of algorithm is computationally equivalent to the Turing machine. This equivalence usually holds both at a computability level and at a computational complexity level modulo polynomial reductions. However, the situation is less clear in what concerns models of computation using real numbers, and no analog of the Church-Turing thesis exists for this case. Recently it was shown that some models of computation with real numbers were equivalent from a computability perspective. In particular it was shown that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to Computable Analysis. However, little is known about what happens at a computational complexity level. In this paper we shed some light on the connections between this two models, from a computational complexity level, by showing that, modulo polynomial reductions, computations of Turing machines can be simulated by GPACs, without the need of using more (space) resources than those used in the original Turing computation, as long as we are talking about bounded computations. In other words, computations done by the GPAC are as space-efficient as computations done in the context of Computable Analysis.
Unable to display preview. Download preview PDF.
- 4.Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer (1998)Google Scholar
- 7.Bournez, O., Graça, D.S., Pouly, A.: On the complexity of solving initial value problems. Submitted to the Conference ISSAC 2012: International Symposium on Symbolic and Algebraic Computation (2012)Google Scholar
- 9.Brattka, V.: The emperor’s new recursiveness: the epigraph of the exponential function in two models of computability. In: Ito, M., Imaoka, T. (eds.) Words, Languages & Combinatorics III, ICWLC 2000, Kyoto, Japan (2000)Google Scholar
- 13.Copeland, J.: Even Turing machines can compute uncomputable functions. In: Casti, J., Calude, C., Dinneen, M. (eds.) Unconventional Models of Computation (UMC 1998), pp. 150–164. Springer (1998)Google Scholar
- 17.Ko, K.-I.: Computational Complexity of Real Functions. Birkhäuser (1991)Google Scholar
- 19.Odifreddi, P.: Classical Recursion Theory, vol. 1. Elsevier (1989)Google Scholar
- 20.Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer (1989)Google Scholar
- 23.Sipser, M.: Introduction to the Theory of Computation, 2nd edn. Course Technology (2005)Google Scholar
- 24.Weihrauch, K.: Computable Analysis: an Introduction. Springer (2000)Google Scholar