The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Recursive functionals
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
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
An undergraduate program in computer science—preliminary recommendations
Communications of the ACM
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Computation beyond turing machines
Communications of the ACM - Digital rights management
Intelligence Without Reason
Communications of the ACM - Has the Internet become indispensable?
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.
Turing machines, transition systems, and interaction
Information and Computation
Zeno machines and hypercomputation
Theoretical Computer Science
Opcodes as predictor for malware
International Journal of Electronic Security and Digital Forensics
Potential Infinity and the Church Thesis
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Noisy defenses: subverting malware's OODA loop
Proceedings of the 4th annual workshop on Cyber security and information intelligence research: developing strategies to meet the cyber security and information intelligence challenges ahead
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Cyber-Physical Systems and Events
Software-Intensive Systems and New Computing Paradigms
Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Adaptation and Evolution in Dynamic Persistent Environments
Electronic Notes in Theoretical Computer Science (ENTCS)
The Role of Agent Interaction in Models of Computing: Panelist Reviews
Electronic Notes in Theoretical Computer Science (ENTCS)
Communications of the ACM
Indirect interaction in environments for multi-agent systems
E4MAS'05 Proceedings of the 2nd international conference on Environments for Multi-Agent Systems
Potential Infinity and the Church Thesis
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
| Hi-index | 0.02 |
According to the interactive view of computation, communication happens during the computation, not before or after it. This approach, distinct from concurrency theory and the theory of computation, represents a paradigm shift that changes our understanding of what is computation and how it is modeled. Interaction machines extend Turing machines with interaction to capture the behavior of concurrent systems, promising to bridge these two fields. This promise is hindered by the widespread belief, incorrectly known as the Church-Turing thesis, that no model of computation more expressive than Turing machines can exist. Yet Turing's original thesis only refers to the computation of functions and explicitly excludes other computational paradigms such as interaction. In this paper, we identify and analyze the historical reasons for this widespread belief. Only by accepting that it is false can we begin to properly investigate formal models of interaction machines. We conclude the paper by presenting one such model, Persistent Turing Machines (PTMs). PTMs capture sequential interaction, which is a limited form of concurrency; they allow us to formulate the Sequential Interaction Thesis, going beyond the expressiveness of Turing machines and of the Church-Turing thesis.