# Interactive computation

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Interactive_computation
> Markdown URL: https://mediated.wiki/source/Interactive_computation.md
> Source: https://en.wikipedia.org/wiki/Interactive_computation
> Source revision: 1324118472
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

{{Distinguish|Interactive computing}}

In [computer science](/source/computer_science), '''interactive computation''' is a [mathematical model](/source/mathematical_model) for [computation](/source/computation) that involves [input/output](/source/input%2Foutput) communication with the external world {{em|during}} computation.

==Uses==

Among the currently studied mathematical models of computation that attempt to capture interaction are [Giorgi Japaridze](/source/Giorgi_Japaridze)'s hard- and easy-play machines elaborated within the framework of [computability logic](/source/computability_logic), [Dina Q. Goldin](/source/Dina_Q._Goldin)'s Persistent Turing Machines (PTMs), and [Yuri Gurevich](/source/Yuri_Gurevich)'s [abstract state machine](/source/abstract_state_machine)s. [Peter Wegner](/source/Peter_Wegner_(computer_scientist)) has additionally done a great deal of work on this area of computer science {{cn|date=August 2018}}.

==See also==
*[Cirquent calculus](/source/Cirquent_calculus)
*[Computability logic](/source/Computability_logic)
*[Game semantics](/source/Game_semantics)
*[Human-based computation](/source/Human-based_computation)
*[Hypercomputation](/source/Hypercomputation)
*[Interactive programming](/source/Interactive_programming)
*[Membrane computing](/source/Membrane_computing)
*[Quasi-empiricism](/source/Quasi-empiricism_in_mathematics)
*[RE (complexity)](/source/RE_(complexity))
*[Super-recursive algorithm](/source/Super-recursive_algorithm)

==References==

*''Interactive Computation: The New Paradigm'' {{ISBN|3-540-34666-X}}. Edited by D. Goldin, S. Smolka and P. Wegner. Springer, 2006.
* D. Goldin, [https://www.researchgate.net/profile/Dina_Goldin/publication/225181994_Persistent_Turing_Machines_as_a_Model_of_Interactive_Computation/links/55f2fafd08ae6a34f65e811e/Persistent-Turing-Machines-as-a-Model-of-Interactive-Computation.pdf 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, [https://www.sciencedirect.com/science/article/pii/S0890540104001257/pdf?md5=089dffc5232a9ba5bc71fb41c475afcb&pid=1-s2.0-S0890540104001257-main.pdf Turing Machines, Transition Systems, and Interaction]. ''J. Information and Computation'' 194:2 (2004), pp. 101-128
*[P. Wegner](/source/Peter_Wegner_(computer_scientist)), [http://www.sciencedirect.com/science/article/pii/S0304397597001540 Interactive foundations of computing].  ''Theoretical Computer Science'' 192 (1998), pp. 315-351.

==External links==

*[http://www.eecs.umich.edu/gasm Abstract State Machines] OUT DATED 2009
*[https://en.wikipedia.org/wiki/Abstract_state_machine }

Category:Theory of computation
Category:Theoretical computer science

---
Adapted from the Wikipedia article [Interactive computation](https://en.wikipedia.org/wiki/Interactive_computation) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Interactive_computation?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.