Interaction, Computability, and Church's Thesis Interaction, Computability, and Church's Thesis Contents 1. Interaction Machines 1.1. Sequential Interaction Machines (sims) 1.2. Interactive Behavior and Expressiveness 1.3. Multi-stream Interaction Machines (mims) 2. Extensions of Expressiveness 2.1.

This article formalizes the claim that interactive finite computing agents are more expre than Turing machines. The impact of models of interaction on Church’s thesis and Godel’s incomple result is explored. The evolution from algorithmic to interactive models of computation in computer a tecture, software engineering, and AI is considered in a final section.

[1]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[2]  Saul Kripke,et al.  A completeness theorem in modal logic , 1959, Journal of Symbolic Logic.

[3]  Dana S. Scott,et al.  Finite Automata and Their Decision Problems , 1959, IBM J. Res. Dev..

[4]  Dana S. Scott,et al.  The lattice of flow diagrams , 1971, Symposium on Semantics of Algorithmic Languages.

[5]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[6]  F. Honsell,et al.  Set theory with free construction principles , 1983 .

[7]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[8]  Robin Milner,et al.  Operational and Algebraic Semantics of Concurrent Processes , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  A. R. D. Mathias,et al.  NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14) , 1991 .

[10]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[11]  Ralph Johnson,et al.  design patterns elements of reusable object oriented software , 2019 .

[12]  Philip E. Agre,et al.  Computational Research on Interaction and Agency , 1995, Artif. Intell..

[13]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[14]  Vaughan R. Pratt,et al.  Chu Spaces and Their Interpretation as Concurrent Objects , 1995, Computer Science Today.

[15]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[16]  Michael Prasse,et al.  Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability , 1998, Comput. J..

[17]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[18]  Peter Wegner,et al.  Interactive , 2021, Encyclopedia of the UN Sustainable Development Goals.

[19]  Peter Wegner,et al.  Coinductive Models of Finite Computing Agents , 1999, CMCS.

[20]  Peter Wegner,et al.  Behavior and Expressiveness of Persistent Turing Machines , 1999 .

[21]  Peter Wegner,et al.  Mathematical Models of Interactive Computing , 1999 .