In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated...

Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated...

In computability theory, a Turing reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle B} is an oracle machine...

Computability is the ability to solve a problem by an effective procedure. It is a key topic of the field of computability theory within mathematical...

Recursive Functions and Effective Computability, MIT Press. ISBN 0-262-68052-1 S. Barry Cooper (2004). Computability Theory. Chapman and Hall/CRC. ISBN 1-58488-237-9...

In computational complexity theory, a log-space reduction is a reduction computable by a deterministic Turing machine using logarithmic space. Conceptually...

In computability theory and computational complexity theory, a reduction is an algorithm for transforming one problem into another problem. A sufficiently...

analysis of algorithms and computability theory. A key distinction between analysis of algorithms and computational complexity theory is that the former is...

In computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction that converts instances...

Orchestrated objective reduction (Orch OR) is a controversial theory postulating that consciousness originates at the quantum level inside neurons (rather...

In computational complexity theory and computability theory, a counting problem is a type of computational problem. If R is a search problem then c R...

In computability theory and computational complexity theory, a decision problem is a computational problem that can be posed as a yes–no question on a...

In complexity theory and computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a black...

compounds Ore reduction: see smelting Reduction (complexity), a transformation of one problem into another problem Reduction (recursion theory), given sets...

suggestion that a newer theory does not replace or absorb an older one, but reduces it to more basic terms. Theory reduction itself is divisible into...

This is a list of computability and complexity topics, by Wikipedia page. Computability theory is the part of the theory of computation that deals with...

The uncertainty reduction theory (URT), also known as initial interaction theory, developed in 1975 by Charles Berger and Richard Calabrese, is a communication...

computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in...

Computability logic (CoL) is a research program and mathematical framework for redeveloping logic as a systematic formal theory of computability, as opposed...

theory — Combinatorial game theory — Computability theory — Computational complexity theory — Deformation theory — Dimension theory — Ergodic theory —...

In computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's...

and =β meaning equivalence with β-reduction. See the Church–Turing thesis for other approaches to defining computability and their equivalence. Church's...

In computability theory, the Ackermann function, named after Wilhelm Ackermann, is one of the simplest and earliest-discovered examples of a total computable...

many-one reduction in computability theory. A property of a theory or logical system weaker than decidability is semidecidability. A theory is semidecidable...

Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the...

of the reduction by considering only the S-polynomials. This is a fundamental fact for Gröbner basis theory and all algorithms for computing them. For...

computers provide no additional power over classical computers in terms of computability. This means that quantum computers cannot solve undecidable problems...

In computability theory, a set P of functions N → N {\displaystyle \mathbb {N} \rightarrow \mathbb {N} } is said to be Medvedev-reducible to another set...

with respect to the computability-logic semantics. In "On the system CL12 of computability logic", on the platform of computability logic, Japaridze generalized...

In computability theory, a decider is a Turing machine that halts for every input. A decider is also called a total Turing machine as it represents a total...