Jump to content

Interactive computation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Kadane (talk | contribs) at 19:47, 4 August 2018 (added computer science portal to see also; created uses section; added external Links section; added references section; remove section References and external web sources; restructured sentence to remove unsourced material.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

This sandbox is in the article namespace. Either move this page into your userspace, or remove the {{User sandbox}} template.

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. However the Turing machine model only provides an answer to the question of what computability of functions means and, with interactive tasks not always being reducible to functions, it fails to capture our broader intuition of computation and computability. It was not until recently 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 Abstract state machines. Peter Wegner has additionally done a great deal of work on this area of computer science [citation needed].

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, 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, Turing Machines, Transition Systems, and Interaction. J. Information and Computation 194:2 (2004), pp. 101-128
  • P. Wegner, Interactive foundations of computing. Theoretical Computer Science 192 (1998), pp. 315-351.