Interaction, Computability, and Church’s Thesis

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