Turing machines can be efficiently simulated by the General Purpose Analog Computer

Amaury Pouly, Olivier Bournez, Daniel S. Graça

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…