In
computer science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...
, interactive computation is a
mathematical model
A mathematical model is an abstract and concrete, abstract description of a concrete system using mathematics, mathematical concepts and language of mathematics, language. The process of developing a mathematical model is termed ''mathematical m ...
for
computation
A computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computation are mathematical equation solving and the execution of computer algorithms.
Mechanical or electronic devices (or, hist ...
that involves
input/output
In computing, input/output (I/O, i/o, or informally io or IO) is the communication between an information processing system, such as a computer, and the outside world, such as another computer system, peripherals, or a human operator. Inputs a ...
communication with the external world ''during'' 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 Peter Wegner may refer to:
* Peter Wegner (computer scientist) (1932–2017), professor of computer science at Brown University, Rhode Island, United States
* Peter Wegner (American artist) (born 1963)
* Peter Wegner (Australian artist)
See also has additionally done a great deal of work on this area of computer science .
See also
*
Cirquent calculus
*
Computability logic
*
Game semantics
Game semantics is an approach to Formal semantics (logic), formal semantics that grounds the concepts of truth or Validity (logic), validity on Game theory, game-theoretic concepts, such as the existence of a winning strategy for a player. In this ...
*
Human-based computation
*
Hypercomputation
Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that could solve the halting problem would be a hypercomputer; so too woul ...
*
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 answ ...
*
Super-recursive algorithm
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">Theory of computation">}
Theory of computation
Theoretical computer science