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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

1997

A real is called recursively enumerable if it can be approximated by an increasing, recursive sequence of rationals. The halting…

1989

Abstract Work in the setting of the recursively enumerable sets and their Turing degrees. A set X is low if X′, its Turing jump…

1986

The classification of algebraic structures which can be embedded into ℛ, the uppersemilattice of recursively enumerable degrees…

1984

Abstract A subspace V of an infinite dimensional fully effective vector space V∞ is called decidable if V is r.e. and there…

1982

At the 1976 Oxford Conference, Aanderaa introduced a new class of machines which he called F machines (later renamed as modular…

Highly Cited

1979

Highly Cited

1979

Charactenzattons of recurs~vely enumerable sets as mappings of equality and mtmmal sets are given An equality (minimal) set is…

1978

Ever since Post [4] the structure of recursively enumerable sets and their classification has been an important area in recursion…

1972

Abstract Let N, O and S denote the set of nonnegative integers, the graph of the constant 0 function and the graph of the…

1969

Let q0, q1,… be a standard enumeration of all partial recursive functions of one variable. For each i, let wi = range qi and for…

1968

The main purpose of this paper is to improve upon the main theorem of Martin [2 ]. Martin gave a sufficient condition for a…