2000 character limit reached
A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-
Published 31 Jul 2012 in cs.LO and cs.CC | (1207.7148v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.