On computable enumerations. I
From MaRDI portal
Publication:2264759
DOI10.1007/BF02219286zbMath0273.02024MaRDI QIDQ2264759
Publication date: 1969
Published in: Algebra and Logic (Search for Journal in Brave)
03D20: Recursive functions and relations, subrecursive hierarchies
03D25: Recursively (computably) enumerable sets and degrees
03D99: Computability and recursion theory
Related Items
A learning-theoretic characterization of classes of recursive functions, Constructive periodic Abelian groups, On some examples of upper semilattices of computable enumerations, The upper semilattice \(L(\gamma)\), Reducibility of partial recursive functions, Enumerations of families of general recursive functions, Recognition of invariant properties of algorithms, Hereditarily effective operations, The quantity of nonautoequivalent constructivizations, Positive enumerations, Constructive models of complete solvable theories, Learning by the process of elimination, On inseparable pairs
Cites Work
- Unnamed Item
- Degrees of Computability
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Creative Functions
- STANDARD CLASSES OF RECURSIVELY ENUMERABLE SETS
- On the indexing of classes of recursively enumerable sets
- Godel Numberings Versus Friedberg Numberings