Interactive computation: Difference between revisions

Content deleted Content added
m remove user sand box template at top.
AnomieBOT (talk | contribs)
m Dating maintenance tags: {{Cn}}
Line 7:
==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==