Interactions of computability and randomness

MaRDI QIDQ3096589zbMATH OpenFDO

Authors André Nies

Publication date 11 November 2011

Full work available at URL http://ebooks.worldscinet.com/ISBN/9789814324359/9789814324359_0039.html

zbMATH Keywords

cost functionsurvey papercomputable analysisalgorithmic randomness\(K\)-trivialitylowness property

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• Lowness properties and randomness
• Studying randomness through computation
• scientific article; zbMATH DE number 1531917
• \(K\)-trivial, \(K\)-low and MLR-low sequences: a tutorial
• Computability and randomness

Cited in

(17)

• Martin-Löf reducibility and cost functions
• The Combinatorics of Non-determinism
• Calculus of cost functions
• \(K\)-trivial, \(K\)-low and MLR-low sequences: a tutorial
• Coherent randomness tests and computing the \(K\)-trivial sets
• Computing from projections of random points
• On randomness, determinism and computability
• Studying randomness through computation
• Randomness, computation and mathematics
• Computability and randomness
• Nullifying randomness and genericity using symmetric difference
• Computably enumerable sets below random sets
• On the interplay between effective notions of randomness and genericity
• Lowness, Randomness, and Computable Analysis
• Lowness properties and randomness
• Computational randomness and lowness
• Characterizing the strongly jump-traceable sets via randomness

This page was built for publication: Interactions of computability and randomness

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