Studying randomness through computation

zbMATH Open1250.68135MaRDI QIDQ3224092FDOQ3224092

Authors: André Nies 

Publication date: 29 March 2012

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

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

zbMATH Keywords

randomness\(K\)-trivialitylowness

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Lowness, Randomness, and Computable Analysis
• The Slaman-Wehner theorem in higher recursion theory

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)