Interactive computation: Difference between revisions

Revision as of 06:02, 29 August 2018

Revision as of 18:18, 27 November 2018

Line 3:

In [[computer science]], '''interactive computation''' is a [[mathematical model]] for [[computation]] that involves [[input/output]] communication with the external world ''during'' computation. This is in contrast to the traditional understanding of computation which assumes reading input only before computation and writing output only after computation, thus defining a kind of "closed" computation.

The famous [[Church-Turing thesis]] attempts to define computation and computability in terms of [[Turing machines]]. HoweverBecause the Turing machine model only provides an answer to the question of what computability of ''functions'' means and, withbut interactive tasks are not always being reducible to functions,{{clarify|date=November 2018}} it fails to capture oura broader intuition of computation and computability. It was not until recently{{when|date=November 2018}} that the theoretical computer science community realized the necessity to define adequate mathematical models of interactive 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 [[Abstractabstract state machinesmachine]]s. [[Peter Wegner]] has additionally done a great deal of work on this area of computer science {{cn|date=August 2018}}.

==See also==