interactive computation
{{Distinguish|Interactive computing}}
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 {{cn|date=August 2018}}.
See also
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, [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 }