Reference articles on history, science, culture and more
Surprise meSurprise meSubscribe
Encyclopedia

Interactive computation

Wikipedia contributorsAdapted for Fathomly · View authors
1 min read
Source updated November 25, 2025

In computer science, interactive computation is a mathematical model for computation that involves input/output communication with the external world during computation.

01Uses

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 .

Watch videos about Interactive computationExplainers and documentaries on YouTube (opens in a new tab)

Sources and credits

This article is adapted from the Wikipedia article “Interactive computation”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.

Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.

Continue exploring

Related topics

Cirquent calculus

Cirquent calculus is a proof calculus that combines aspects of sequent calculus and boolean circuits. Its proof-objects are graph-style objects, termed cirquents, as opposed to the traditional tree-style objects such as formulas or sequents.

Computability logic

Computability logic is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed to classical logic, which is a formal theory of truth. It was introduced and so named by Giorgi Japaridze in 2003.

Game semantics

Game semantics is an approach to formal semantics that grounds the concepts of truth or validity on game-theoretic concepts, such as the existence of a winning strategy for a player. In this framework, logical formulas are interpreted as defining games between two players.