In
computer science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to Applied science, practical discipli ...
, interactive computation is a
mathematical model
A mathematical model is a description of a system using mathematical concepts and language. The process of developing a mathematical model is termed mathematical modeling. Mathematical models are used in the natural sciences (such as physics, ...
for
computation
Computation is any type of arithmetic or non-arithmetic calculation that follows a well-defined model (e.g., an algorithm).
Mechanical or electronic devices (or, historically, people) that perform computations are known as ''computers''. An esp ...
that involves
input/output
In computing, input/output (I/O, or informally io or IO) is the communication between an information processing system, such as a computer, and the outside world, possibly a human or another information processing system. Inputs are the signals ...
communication with the external world ''during'' computation.
Uses
Among the currently studied mathematical models of computation that attempt to capture interaction are
Giorgi Japaridze Giorgi Japaridze (also spelled Giorgie Dzhaparidze) is a Georgian-American researcher in logic and theoretical computer science. He currently holds the title of Full Professor at the Computing Sciences Department of Villanova University. Japaridze i ...
's hard- and easy-play machines elaborated within the framework of
computability logic
Computability logic (CoL) 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 Gi ...
,
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 .
See also
*
Cirquent calculus
*
Computability logic
Computability logic (CoL) 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 Gi ...
*
Game semantics
Game semantics (german: dialogische Logik, translated as '' dialogical logic'') 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 play ...
*
Human-based computation
*
Hypercomputation
*
Interactive programming
*
Membrane computing
*
Quasi-empiricism
*
RE (complexity) In computability theory and computational complexity theory, RE ( recursively enumerable) is the class of decision problems for which a 'yes' answer can be verified by a Turing machine in a finite amount of time. Informally, it means that if the an ...
*
Super-recursive algorithm
In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" dev ...
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. WegnerInteractive foundations of computing ''Theoretical Computer Science'' 192 (1998), pp. 315-351.
External links
Abstract State MachinesOUT DATED 2009
}
Theory_of_computation
Theoretical_computer_science.html" ;"title="Theory of computation">}
Theory of computation
Theoretical computer science">Theory of computation">}
Theory of computation
Theoretical computer science