Skip to search formSkip to main contentSkip to account menu

Recursively enumerable set

Known as: CE, Partially decidable, Co-r.e. 
In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
AlgorithmAlpha recursion theoryArithmetical hierarchyArithmetical set

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
1997
1997
Series Recursively Enumerable Reals and Chaitin Numbers
A real is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting… 
1995
1995
Degree theoretic definitions of the low2 recursively enumerable sets
The primary relation studied in recursion theory is that of relative complexity: A set or function A (of natural numbers) is… 
1986
1986
Lattice embeddings into the recursively enumerable degrees
The classification of algebraic structures which can be embedded into ℛ, the uppersemilattice of recursively enumerable degrees… 
1984
1984
Decidable subspaces and recursively enumerable subspaces
Abstract A subspace V of an infinite dimensional fully effective vector space V∞ is called decidable if V is r.e. and there… 
Highly Cited
1981
Highly Cited
1981
Recursive isomorphism types of recursive Boolean algebras
A Boolean algebra is recursive if B is a recursive subset of the natural numbers N and the operations ∧ (meet), ∨ (join), and… 
Highly Cited
1979
Highly Cited
1979
A Purely Homomorphic Characterization of Recursively Enumerable Sets
Charactenzattons of recurs~vely enumerable sets as mappings of equality and mtmmal sets are given An equality (minimal) set is… 
Highly Cited
1974
Highly Cited
1974
Minimal pairs and high recursively enumerable degrees
A. H. Lachlan [2] and C. E. M. Yates [4] independently showed that minimal pairs of recursively enumerable (r.e.) degrees exist… 
1972
1972
Characterization of recursively enumerable sets
Abstract Let N, O and S denote the set of nonnegative integers, the graph of the constant 0 function and the graph of the… 
1968
1968
COMPLETE RECURSIVELY ENUMERABLE SETS
The main purpose of this paper is to improve upon the main theorem of Martin [2 ]. Martin gave a sufficient condition for a… 
1953
1953
Two notes on recursively enumerable sets
Introduction. These notes are based on E. L. Post's paper Recursively enumerable sets of positive integers and their decision… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)