The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Database metatheory: asking the big queries
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Why interaction is more powerful than algorithms
Communications of the ACM
Interactive foundations of computing
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Letters to the editor: go to statement considered harmful
Communications of the ACM
An undergraduate program in computer science—preliminary recommendations
Communications of the ACM
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Computing Machines Can't Be Intelligent (...and Turing Said So)
Minds and Machines
Minds and Machines
Computation beyond turing machines
Communications of the ACM - Digital rights management
Intelligence Without Reason
Communications of the ACM - Has the Internet become indispensable?
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Turing machines, transition systems, and interaction
Information and Computation - Special issue: Commemorating the 50th birthday anniversary of Paris C. Kanellakis
Formal languages and their relation to automata
Formal languages and their relation to automata
Programming Languages, Information Structures, and Machine Organization.
Programming Languages, Information Structures, and Machine Organization.
Church's Thesis After 70 Years
Church's Thesis After 70 Years
The church-turing thesis: breaking the myth
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability and discrete dynamical systems
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Non-deterministic parallelism considered useful
HotOS'13 Proceedings of the 13th USENIX conference on Hot topics in operating systems
The computational power of interactive recurrent neural networks
Neural Computation
Architectural Resiliency in Distributed Computing
International Journal of Grid and High Performance Computing
Architectural Resiliency in Distributed Computing
International Journal of Grid and High Performance Computing
Information and Computation
| Hi-index | 0.00 |
The classical view of computing positions computation as a closed-box transformation of inputs (rational numbers or finite strings) to outputs. According to the interactive view of computing, computation is an ongoing interactive process rather than a function-based transformation of an input to an output. Specifically, communication with the outside world happens during the computation, not before or after it. This approach radically changes our understanding of what is computation and how it is modeled. The acceptance of interaction as a new paradigm is hindered by the Strong Church---Turing Thesis (SCT), the widespread belief that Turing Machines (TMs) capture all computation, so models of computation more expressive than TMs are impossible. In this paper, we show that SCT reinterprets the original Church---Turing Thesis (CTT) in a way that Turing never intended; its commonly assumed equivalence to the original is a myth. We identify and analyze the historical reasons for the widespread belief in SCT. Only by accepting that it is false can we begin to adopt interaction as an alternative paradigm of computation. We present Persistent Turing Machines (PTMs), that extend TMs to capture sequential interaction. PTMs allow us to formulate the Sequential Interaction Thesis, going beyond the expressiveness of TMs and of the CTT. The paradigm shift to interaction provides an alternative understanding of the nature of computing that better reflects the services provided by today's computing technology.