scientific article

zbMath0523.03029MaRDI QIDQ3674634

Marat M. Arslanov

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fixed point theoremrecursive functionsTuring degrees

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (20)

Partial combinatory algebra and generalized numberings ⋮ Fixpoints and relative precompleteness ⋮ Numberings, c.e. oracles, and fixed points ⋮ Extremal numberings and fixed point theorems ⋮ Lowness for isomorphism, countable ideals, and computable traceability ⋮ Completeness criteria for a class of reducibilities ⋮ Demuth randomness and computational complexity ⋮ On a general method of constructing post reducibilities and the corresponding completeness criteria ⋮ Independence, relative randomness, and PA degrees ⋮ On the number of infinite sequences with trivial initial segment complexity ⋮ Subspaces of computable vector spaces ⋮ GENERALIZATIONS OF THE RECURSION THEOREM ⋮ INTRINSIC SMALLNESS ⋮ Precomplete numberings ⋮ Three Theorems on n-REA Degrees: Proof-Readers and Verifiers ⋮ Fixed point theorems for precomplete numberings ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ The noneffectivity of Arslanov's completeness criterion and related theorems ⋮ When van Lambalgen’s Theorem fails ⋮ Another note on the join property

This page was built for publication: