scientific article; zbMATH DE number 4118353

zbMath0683.03024MaRDI QIDQ4732457

Antonín Kučera

Publication date: 1989

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

zbMATH Keywords

NAPDNRdiagonally nonrecursive functionsSacks Jump Theoremincomplete high r.e. setsinfinite-injury prioritynonapproximable in measure degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (8)

Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers ⋮ Optimal redundancy in computations from random oracles ⋮ Demuth randomness and computational complexity ⋮ A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals ⋮ On relative randomness ⋮ Trivial Reals ⋮ There are no maximal low d.c.e. degrees ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees

This page was built for publication: