A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-

  • Dershowitz N
  • Falkovich E
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free