scientific article; zbMATH DE number 2204767

MaRDI QIDQ5316387zbMATH OpenFDO

Authors Rodney G. Downey

Publication date 12 September 2005

zbMATH Keywords

algorithmic randomnesscomplexity of realspresentationrandom realsrepresentationspectra

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited in

(11)

• Classification of computably approximable real numbers
• The Kolmogorov complexity of random reals
• On the Reals Which Cannot Be Random
• Hierarchy of Computably Enumerable Degrees II
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Classification of the computable approximations by divergence boundings
• Structure and Randomness in Computability and Set Theory
• On the hierarchies of Δ₂⁰-real numbers
• Random reals and possibly infinite computations Part I: Randomness in ∅′
• A hierarchy of Turing degrees of divergence bounded computable real numbers
• Undecidability of the structure of the Solovay degrees of c.e. reals

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316387)