|
Interactive Computation
In computer science, interactive computation is a mathematical model for computation that involves input/output 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 has additionally done a great deal of work on this area of computer science . See also * Cirquent calculus * Computability logic *Game semantics * 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. Informal ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 Giorgi Japaridze in 2003. In classical logic, formulas represent true/false statements. In CoL, formulas represent computational problems. In classical logic, the validity of an argument depends only on its form, not on its meaning. In CoL, validity means being always computable. More generally, classical logic tells us when the truth of a given statement always follows from the truth of a given set of other statements. Similarly, CoL tells us when the computability of a given problem ''A'' always follows from the computability of other given problems ''B1,...,Bn''. Moreover, it provides a uniform way to actually construct a solution (algorithm) for such an ''A'' from any known solutions of ''B1,...,Bn''. CoL formulates computational ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Super-recursive Algorithm
In computability theory, super-recursive algorithms are posited as a generalization of hypercomputation: hypothetical algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book ''Super-recursive algorithms'' develops their theory and presents several mathematical models. Burgin argues that super-recursive algorithms can be used to disprove the Church–Turing thesis. This point of view has been criticized within the mathematical community and is not widely accepted. Definition Burgin (2005: 13) uses the term recursive algorithms for algorithms that can be implemented on Turing machines, and uses the word ''algorithm'' in a more general sense. Then a super-recursive class of algorithms is "a class of algorithms in which it is possible to compute functions not computable by any Turing machine" (Burgin 2005: 107) Super-recursive algorithms are also related to algorithmic schemes, another novel concept from B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
