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

\(K\)-trivialityalgorithmic randomnesscomputable analysiscost functionlowness propertysurvey paper

Mathematics Subject Classification ID

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

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

(18)

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

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)