Live briefing
Everything about Computable set
Set with algorithmic membership test
In computability theory, a set of natural numbers is computable if there is an algorithm that computes the membership of every natural number in a finite number of steps. Formally, a subset of the natural numbers is computable if there exists a total computable function such that Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Computable setA 5-minute orientation
- Skim a recent paper: Universal Set of Composition Operations for Computable Functions with Parallel Process Semantics and a Functional Programming Language Based on ThemInfluential work since 2022
- Pick up a classic book: A first course in fuzzy logicThe most-reprinted book on the subject
- Read the landmark paper: A Level Set Approach for Computing Solutions to Incompressible Two-Phase FlowCited 4,243 times
- Go sideways: Computably enumerable setA 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)
A Level Set Approach for Computing Solutions to Incompressible Two-Phase Flow
Basis Set Exchange: A Community Database for Computational Sciences
Is the Mandelbrot set computable?
A comparison of concepts from computable analysis and effective descriptive set theory
Order-Computable Sets
Techniques of computable set theory with applications to proof verification
Almost Every Real Quadratic Polynomial has a Poly-time Computable Julia Set
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
🆕 Influential since 2022
📚 Books worth reading
A first course in fuzzy logicHung T. Nguyen, Elbert A. Walker · 1997
Limits of computationEdna E. Reiter · 2012
Rough-neural computingSankar K. Pal, Lech Polkowski · 2003
Rough SetsLech Polkowski · 2002
Category Theory for the SciencesDavid I. Spivak · 2014
Notes on set theoryYiannis N. Moschovakis · 1994
ComputabilityRichard L. Epstein, Richard .L. Epstein · 1988
MIPS RISC ArchitectureGerry Kane · 1989
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Computably enumerable set In computability theory, a set S of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable…
- 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…
- Arithmetical hierarchy In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene–Mostowski hierarchy (after mathematicians Stephen Cole Kleene and Andrzej…
- Computability theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated…
- Enumeration An enumeration is a complete, ordered listing of all the items in a collection. The term is commonly used in mathematics and computer science to refer…
- Creative and productive sets In computability theory, productive sets and creative sets are types of sets of natural numbers that have important applications in mathematical logic…
- Maximal set (computability theory) In computability theory, a maximal set is a coinfinite computably enumerable subset A of the natural numbers such that for every further computably enumerable…
- Numbering (computability theory) In computability theory a numbering is an assignment of natural numbers to a set of objects such as functions, rational numbers, graphs, or words in some…