In computer science, interactive computation is a mathematical model for computation that involves input/output communication with the external world during computation. This is in contrast to the traditional understanding of computation which assumes reading input only before computation and writing output only after computation, thus defining a kind of "closed" computation.
The Church-Turing thesis attempts to define computation and computability in terms of Turing machines. Because the Turing machine model only provides an answer to the question of what computability of functions means, but interactive tasks are not always reducible to functions,[clarification needed] it fails to capture a broader intuition of computation and computability. It was not until recently[when?] that the theoretical computer science community realized the necessity to define adequate mathematical models of interactive computation.
Among the currently studied mathematical models of computation that attempt to capture interaction are Giorgi Japaridze's hard- and easy-play machines elaborated within the framework of computability logic, Dina Q. Goldin's Persistent Turing Machines (PTMs), and Yuri Gurevich's abstract state machines. Peter Wegner has additionally done a great deal of work on this area of computer science.
- Cirquent calculus
- Computability logic
- Game semantics
- Human-based computation
- Interactive programming
- Membrane computing
- RE (complexity)
- Super-recursive algorithm
- Interactive Computation: The New Paradigm ISBN 3-540-34666-X. Edited by D. Goldin, S. Smolka and P. Wegner. Springer, 2006.
- D. Goldin, Persistent Turing Machines as a model of interactive computation. Lecture Notes in Computer Science 1762, pp. 116-135.
- D. Goldin, S. Smolka, P. Attie, E. Sonderegger, Turing Machines, Transition Systems, and Interaction. J. Information and Computation 194:2 (2004), pp. 101-128
- P. Wegner, Interactive foundations of computing. Theoretical Computer Science 192 (1998), pp. 315-351.