Emergent Mind
A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
(1207.7148)
Published Jul 31, 2012
in
cs.LO
and
cs.CC
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.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.