scientific article; zbMATH DE number 5354044

MaRDI QIDQ3530393zbMATHFDO

Authors Noam Greenberg, Nenad Mihailovic, André Nies, Rodney G. Downey

Publication date 20 October 2008

zbMATH Keywords

Kolmogorov complexityrandomnesslowness properties

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Lowness, Randomness, and Computable Analysis
• Complexity lower bounds for machine computing models
• scientific article; zbMATH DE number 4087011
• Turing machines with few accepting computations and low sets for PP
• Low upper bounds in the Turing degrees revisited
• scientific article; zbMATH DE number 3987247
• Computability
• scientific article; zbMATH DE number 3922632
• Some Relations between Classes of Low Computational Complexity

Cited in

(6)

• Process and truth-table characterisations of randomness
• Reducibilities relating to Schnorr randomness
• Strong jump-traceability. I: The computably enumerable case
• Lowness for Demuth Randomness
• Randomness and lowness notions via open covers
• Schnorr triviality and its equivalent notions

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 Q3530393)