Interactive computation
title: "Interactive computation" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["theory-of-computation", "theoretical-computer-science"] topic_path: "technology/computing" source: "https://en.wikipedia.org/wiki/Interactive_computation" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0
In computer science, interactive computation is a mathematical model for computation that involves input/output communication with the external world during computation.
Uses
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 .
References
- Interactive Computation: The New Paradigm . 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.
::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::