The complexity of the set of nonrandom numbers

MaRDI QIDQ5448304zbMATH OpenFDO

Authors Frank Stephan

Publication date 20 March 2008

zbMATH Keywords

lownessstrong jump-traceabilitywell-approximation of the jump

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The Kolmogorov complexity of random reals
• scientific article; zbMATH DE number 1064112
• Nonuniform complexity and the randomness of certain complete languages
• scientific article; zbMATH DE number 4211347
• Randomness behaviour in Blum universal static complexity spaces

Cited in

(4)

• Enumerations including laconic enumerators
• scientific article; zbMATH DE number 4131664 (Why is no real title available?)
• Randomness behaviour in Blum universal static complexity spaces
• Randomness in Blum universal static complexity spaces

This page was built for publication: The complexity of the set of nonrandom numbers

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