computable
91Pointclass — In the mathematical field of descriptive set theory, a pointclass is a collection of sets of points, where a point is ordinarily understood to be an element of some perfect Polish space. In practice, a pointclass is usually characterized by some… …
92Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are 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… …
93Ciudadanos en Blanco — Sitio web www.ciudadanosenblanco.com Ciudadanos en Blanco, actualmente llamado Movimiento Ciudadano por el Voto en Blanco C …
94Alan Turing — Turing redirects here. For other uses, see Turing (disambiguation). Alan Turing Turing at the time of his election to Fellowship of the Royal Society …
95Definable real number — A real number a is first order definable in the language of set theory, without parameters, if there is a formula φ in the language of set theory, with one free variable, such that a is the unique real number such that φ(a) holds in the standard… …
96Mandelbrot set — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment …
97Recursively enumerable set — In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable, semidecidable, provable or Turing recognizable if: There is an algorithm such that the set of… …
98Inductive inference — This article is about the mathematical concept, for inductive inference in logic, see Inductive reasoning. Around 1960, Ray Solomonoff founded the theory of universal inductive inference, the theory of prediction based on observations; for… …
99Orch-OR — (Orchestrated Objective Reduction) is a theory of consciousness, which is the joint work of theoretical physicist Sir Roger Penrose and anesthesiologist Stuart Hameroff. Mainstream theories assume that consciousness emerges from the brain, and… …
100Compression theorem — In computational complexity theory the compression theorem is an important theorem about the complexity of computable functions. The theorem states that there exists no largest complexity class, with computable boundary, which contains all… …
