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 es ...
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 G ...
,
Dina Q. Goldin's Persistent Turing Machines (PTMs), and
Yuri Gurevich
Yuri Gurevich, Professor Emeritus at the University of Michigan, is an American computer scientist and mathematician and the inventor of abstract state machines.
Gurevich was born and educated in the Soviet Union. He taught mathematics there an ...
's
abstract state machines.
Peter Wegner
Peter A. Wegner (August 20, 1932 – July 27, 2017) was a computer scientist who made significant contributions to both the theory of object-oriented programming during the 1980s and to the relevance of the Church–Turing thesis for empirical ...
has additionally done a great deal of work on this area of computer science .
See also
*
Cirquent calculus
Cirquent calculus is a proof calculus that manipulates graph-style constructs termed ''cirquents'', as opposed to the traditional tree-style objects such as formulas or sequents. Cirquents come in a variety of forms, but they all share one main c ...
*
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 G ...
*
Game semantics
Game semantics (german: dialogische Logik, translated as ''dialogical logic'') 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, su ...
*
Human-based computation
Human-based computation (HBC), human-assisted computation, ubiquitous human computing or distributed thinking (by analogy to distributed computing) is a computer science technique in which a machine performs its function by outsourcing certain ste ...
*
Hypercomputation
Hypercomputation or super-Turing computation refers to models of computation that can provide outputs that are not Turing-computable. Super-Turing computing, introduced at the early 1990's by Hava Siegelmann, refers to such neurological inspired, b ...
*
Interactive programming
Interactive programming is the procedure of writing parts of a program while it is already active. This focuses on the program text as the main interface for a running process, rather than an interactive application, where the program is design ...
*
Membrane computing Membrane computing (or MC) is an area within computer science that seeks to discover new computational models from the study of biological cells, particularly of the cellular membranes. It is a sub-task of creating a cellular model.
Membrane comput ...
*
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.html" ;"title="Theory of computation">}
Theory of computation
Theoretical computer science">Theory of computation">}
Theory of computation
Theoretical computer science