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

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

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...

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...

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

In mathematics, computable measure theory is the part of computable analysis that deals with effective versions of measure theory. Jeremy Avigad (2012)...

In computability theory, a set of natural numbers is called computable, recursive, or decidable if there is an algorithm which takes a number as input...

Computable functions are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion...

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

In computability theory, two disjoint sets of natural numbers are called computably inseparable or recursively inseparable if they cannot be "separated"...

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

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 a numbering is the assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some...

Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic...

In computability theory, a system of data-manipulation rules (such as a model of computation, a computer's instruction set, a programming language, or...

In computability theory, the mortality problem is a decision problem related to the halting problem. For Turing machines, the halting problem can be stated...

perform those computations. In an effort to answer the first question, computability theory examines which computational problems are solvable on various theoretical...

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

no meromorphic extension to z {\displaystyle z} can exist). In computability theory, if f {\displaystyle f} is a partial function on S {\displaystyle...

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

In computability theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order...

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

The computability aspects of this theorem have been thoroughly investigated by researchers in mathematical logic, especially in computability theory. This...

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

in this theory, the existence of a surjection from I onto S need not imply the existence of an injection from S into I. In computability theory one often...

In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct...

In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable...

set theory and philosophy of set theory (particularly the idea of the set-theoretic multiverse), in computability theory, and in group theory. After...

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

as its only output. The standard terms for these programs in the computability theory and computer science literature are "self-replicating programs",...