scientific article; zbMATH DE number 1834658

zbMath0999.03038MaRDI QIDQ4779154

Geoff LaForte, Denis R. Hirschfeldt, Rodney G. Downey

Publication date: 25 November 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2136/21360316

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

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items (13)

Randomness and the linear degrees of computability ⋮ Where join preservation fails in the bounded Turing degrees of c.e. sets ⋮ Undecidability of the structure of the Solovay degrees of c.e. reals ⋮ Non-low\(_2\)-ness and computable Lipschitz reducibility ⋮ On initial segment complexity and degrees of randomness ⋮ Maximal pairs of computably enumerable sets in the computably Lipschitz degrees ⋮ Oscillation in the initial segment complexity of random reals ⋮ On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets ⋮ Maximal pairs of c.e. reals in the computably Lipschitz degrees ⋮ The approximation structure of a computably approximable real ⋮ Trivial Reals ⋮ Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees ⋮ The ibT degrees of computably enumerable sets are not dense

This page was built for publication: