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.

2016

There are several variations of fuzzy Turing machines in the literature, many of them require a t-norm in order to establish…

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…

1976

Let α be an admissible ordinal, and let (α) denote the lattice of α-r.e. sets, ordered by set inclusion. An α-r.e. set A is…

1976

Throughout this paper, α will denote an admissible ordinal. Let (α) denote the lattice of α-r.e. sets, i.e., the lattice whose…

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…

1968

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