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.
CITATION STYLE
Dershowitz, N., & Falkovich, E. (2012). A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-. Electronic Proceedings in Theoretical Computer Science, 88, 72–78. https://doi.org/10.4204/eptcs.88.6
Mendeley helps you to discover research relevant for your work.