nondeterministic turing machine
61Polynomial time — In computational complexity theory, polynomial time refers to the computation time of a problem where the run time, m ( n ), is no greater than a polynomial function of the problem size, n .Written mathematically using big O notation, this states …
62Immerman–Szelepcsényi theorem — The Immerman–Szelepcsényi Theorem was proven independently by Neil Immerman and Róbert Szelepcsényi in 1987, for which they shared the 1995 Gödel Prize. In its general form the theorem states that NSPACE = co NSPACE. In other words, if a… …
63List of computing topics — Originally, the word computing was synonymous with counting and calculating, and the science and technology of mathematical calculations. Today, computing means using computers and other computing machines. It includes their operation and usage,… …
64List of computer scientists — Expand list|date=August 2008This is a list of well known computer scientists, people who do work in computer science, in particular researchers and authors.Some persons notable as programmers are included here because they work in research as… …
65Expressive power — In computer science, the expressive power of a language may refer to: * what can be said in the language (at all) * how concisely it can be said.In informal discussions, the term often refers to the latter sense, or both; e.g. this is often the… …
66Cognitive informatics — (CI) is an emerging discipline that studies the natural intelligence and internal information processing mechanisms of the brain, as well as the processes involved in perception and cognition. CI provides a coherent set of fundamental theories,… …
67EXPSPACE — In complexity theory, EXPSPACE is the set of all decision problems solvable by a deterministic Turing machine in O(2p(n)) space, where p(n) is a polynomial function of n. (Some authors restrict p(n) to be a linear function, but most authors… …
68RP (complexity) — In complexity theory, RP ( randomized polynomial time ) is the complexity class of problems for which a probabilistic Turing machine exists with these properties: RP algorithm (1 run) Answer produced Correct answer YES NO YES ≥ 1/2 ≤ 1/2 NO 0 1 …
69Interactive proof system — In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to… …
70Counter — This article is about the term counter used in electronics and computing. For other uses, see Counter (disambiguation). In digital logic and computing, a counter is a device which stores (and sometimes displays) the number of times a particular… …
