Publication:3674634
From MaRDI portal
zbMath0523.03029MaRDI QIDQ3674634
Publication date: 1981
03D20: Recursive functions and relations, subrecursive hierarchies
03D25: Recursively (computably) enumerable sets and degrees
03D30: Other degrees and reducibilities in computability and recursion theory
Related Items
GENERALIZATIONS OF THE RECURSION THEOREM, COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS, Fixpoints and relative precompleteness, Lowness for isomorphism, countable ideals, and computable traceability, INTRINSIC SMALLNESS, Another note on the join property, Numberings, c.e. oracles, and fixed points, Extremal numberings and fixed point theorems, Demuth randomness and computational complexity, On the number of infinite sequences with trivial initial segment complexity, The noneffectivity of Arslanov's completeness criterion and related theorems, Precomplete numberings, Partial combinatory algebra and generalized numberings, Fixed point theorems for precomplete numberings, Independence, relative randomness, and PA degrees, Subspaces of computable vector spaces, Completeness criteria for a class of reducibilities, On a general method of constructing post reducibilities and the corresponding completeness criteria, Three Theorems on n-REA Degrees: Proof-Readers and Verifiers, When van Lambalgen’s Theorem fails
