Interactive computation: Difference between revisions

Revision as of 03:22, 31 January 2021

Latest revision as of 18:24, 25 December 2024

Line 5:

==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 machine]]s. [[Peter Wegner (computer scientist)|Peter Wegner]] has additionally done a great deal of work on this area of computer science {{cn|date=August 2018}}.

==See also==

Line 24:

* 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

*[[Peter Wegner |(computer scientist)|P. Wegner]], [http://www.sciencedirect.com/science/article/pii/S0304397597001540 Interactive foundations of computing]. ''Theoretical Computer Science'' 192 (1998), pp. 315-351.

==External links==