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

@article{Bournez2013TuringMC,
  title={Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer},
  author={O. Bournez and D. S. Graça and A. Pouly},
  journal={ArXiv},
  year={2013},
  volume={abs/1203.4667}
}
  • O. Bournez, D. S. Graça, A. Pouly
  • Published 2013
  • Computer Science
  • ArXiv
  • 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… CONTINUE READING
    5 Citations
    How to Make a Meaningful Comparison of Models: The Church–Turing Thesis Over the Reals
    • 4
    Computable analysis with applications to dynamic systems
    • P. Collins
    • Computer Science, Mathematics
    • Math. Struct. Comput. Sci.
    • 2020
    Hybrid Analog Signal-Based Models of Computation

    References

    SHOWING 1-10 OF 34 REFERENCES
    Polynomial differential equations compute all real computable functions on computable compact intervals
    • 59
    • PDF
    Accelerating Turing Machines
    • 83
    • PDF
    Coins, Quantum Measurements, and Turing's Barrier
    • 80
    • PDF
    Computational Complexity of Real Functions
    • 124
    Analog computers and recursive functions over the reals
    • 104
    • PDF
    Complexity and Real Computation
    • L. Blum
    • Computer Science, Mathematics
    • Springer New York
    • 1998
    • 1,376
    • PDF
    Introduction to the Theory of Computation
    • 2,272
    • PDF
    EVEN TURING MACHINES CAN COMPUTE UNCOMPUTABLE FUNCTIONS
    • 60