Schnorr dimension

DOI10.1017/S0960129506005469zbMATH Open1125.03033MaRDI QIDQ3422020FDOQ3422020

Authors: Wolfgang Merkle, Jan Reimann, Rodney G. Downey 

Publication date: 9 February 2007

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• New Computational Paradigms
• The arithmetical complexity of dimension and randomness
• Schnorr randomness
• Computer Science Logic
• scientific article; zbMATH DE number 2216397

zbMATH Keywords

effective dimensionrandomnesscomputably enumerable setscomputable packing dimensionhyperimmune Turing degreemachine characterisation

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Applications of computability and recursion theory (03D80)

Cited In (4)

• Subcomputable Hausdorff function dimension
• The arithmetical complexity of dimension and randomness
• Relativized Schnorr tests with universal behavior
• New Computational Paradigms

This page was built for publication: Schnorr dimension

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