A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
arXiv:1207.7148 · doi:10.4204/EPTCS.88.6
Abstract
We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.
In Proceedings DCM 2011, arXiv:1207.6821