Studying randomness through computation

MaRDI QIDQ3224092zbMATH OpenFDO

Authors André Nies

Publication date 29 March 2012

Full work available at URL http://ebooks.worldscinet.com/ISBN/9789814327756/9789814327756_0017.html

zbMATH Keywords

randomness\(K\)-trivialitylowness

Mathematics Subject Classification ID

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

Recommendations

• Computability, algorithmic randomness and complexity
• Interactions of computability and randomness
• Algorithmic randomness and complexity.
• K-trivial, K-low and MLR-low sequences: a tutorial
• scientific article; zbMATH DE number 5657607

Cited in

(6)

• scientific article; zbMATH DE number 440776 (Why is no real title available?)
• K-trivial, K-low and MLR-low sequences: a tutorial
• Computability, algorithmic randomness and complexity
• Lowness, Randomness, and Computable Analysis
• The Slaman-Wehner theorem in higher recursion theory
• Interactions of computability and randomness

This page was built for publication: Studying randomness through computation

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