Live briefing
Everything about Computably enumerable set
Mathematical logic concept
In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if:There is an algorithm such that the set of input numbers for which the algorithm halts is exactly S. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Computably enumerable setA 5-minute orientation
- Skim a recent paper: $$sQ_1$$-degrees of computably enumerable setsInfluential work since 2022
- Pick up a classic book: Recursively enumerable sets and degreesThe most-reprinted book on the subject
- Read the landmark paper: Computably enumerable sets and quasi-reducibilityCited 24 times
- Go sideways: Computability theoryA closely related topic
- Go sideways: Computable functionA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Computably enumerable sets and quasi-reducibility
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
Almost computably enumerable families of sets
Definable Encodings in the Computably Enumerable Sets
On the orbits of computably enumerable sets
Isomorphisms of splits of computably enumerable sets
Kolmogorov complexity and computably enumerable sets
🆕 Influential since 2022
📚 Books worth reading
Recursively enumerable sets and degreesR. I. Soare · 1987
Recursively Enumberable Sets and DegreesRobert I. Soare · 1987
Fundamentals of Computer Programming with CSharp Free Book (by Nakov & Co.)Svetlin Nakov · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…
- Computable function Computable functions are the basic objects of study in computability theory. Informally, a function is computable if there is an algorithm that computes…
- Computable set In computability theory, a set of natural numbers is computable (or decidable, or recursive) if there is an algorithm that computes the membership of every…
- Turing degree In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures…
- Decision problem 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…
- Diophantine set In mathematics, a Diophantine equation is an equation of the form P(x1, ..., xj, y1, ..., yk) = 0 (usually abbreviated P(x, y) = 0) where P(x, y) is a…
- Hilbert's tenth problem Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge…
- Kleene's recursion theorem In computability theory, Kleene's recursion theorems are a pair of fundamental results about the application of computable functions to their own descriptions…