A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
Logic in Computer Science
2012-08-01 v1 Computational Complexity
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.
Keywords
Cite
@article{arxiv.1207.7148,
title = {A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-},
author = {Nachum Dershowitz and Evgenia Falkovich},
journal= {arXiv preprint arXiv:1207.7148},
year = {2012}
}
Comments
In Proceedings DCM 2011, arXiv:1207.6821