scientific article
From MaRDI portal
Publication:3469096
zbMath0694.03027MaRDI QIDQ3469096
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (16)
Degrees of Unsolvability: A Tutorial ⋮ Propagation of partial randomness ⋮ OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS ⋮ Ramsey-type graph coloring and diagonal non-computability ⋮ FORCING WITH BUSHY TREES ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Characterizing the strongly jump-traceable sets via randomness ⋮ The axiomatic power of Kolmogorov complexity ⋮ A DNC function that computes no effectively bi-immune set ⋮ Computable analogs of cardinal characteristics: prediction and rearrangement ⋮ On low for speed oracles ⋮ Probabilistic inductive inference: A survey ⋮ On uniform relationships between combinatorial problems ⋮ Highness properties close to PA completeness ⋮ Mass problems associated with effectively closed sets ⋮ Thin set versions of Hindman's theorem
This page was built for publication:
