World Library  
Flag as Inappropriate
Email this Article

Interactive computation

Article Id: WHEBN0000649418
Reproduction Date:

Title: Interactive computation  
Author: World Heritage Encyclopedia
Language: English
Subject: Quasi-empiricism in mathematics, Computability logic, Computation, Theory of computation, Theoretical computer science
Collection: Theoretical Computer Science, Theory of Computation
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Interactive computation

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. While this fact was admitted by Alan Turing himself, it was not until recently that the theoretical computer science community realized the necessity to define adequate mathematical models of interactive computation. Among the currently studied mathematical models of computation that attempt to capture interaction are Japaridze's hard- and easy-play machines elaborated within the framework of computability logic, Goldin's persistent Turing machines, and Gurevich's abstract state machines. Peter Wegner has additionally done a great deal of work on this area of computer science.

See also

References and external web sources

  • Interactive Computation: The New Paradigm ISBN 3-540-34666-X. Edited by D.Goldin, S.Smolka and P.Wegner. Springer, 2006.
  • Abstract State Machines
  • D.Q.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.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.