scientific article; zbMATH DE number 6019530

MaRDI QIDQ3224084zbMATH OpenFDO

Authors Jean-Paul Delahaye

Publication date 29 March 2012

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

Mathematics Subject Classification ID

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

Recommendations

• Characterising the Martin-Löf random sequences using computably enumerable sets of measure one
• scientific article; zbMATH DE number 3895049
• scientific article; zbMATH DE number 4027455
• Martin-Löf randomness implies multiple recurrence in effectively closed sets
• Stochastically recursive sequences and their generalizations
• scientific article; zbMATH DE number 4103057
• On semimeasures predicting Martin-Löf random sequences
• Remarks on "Random Sequences"
• On irregularity theorems for random sequences

Cited in

(3)

• Recursive events in random sequences
• The equivalence of definitions of algorithmic randomness
• On analogues of the Church-Turing thesis in algorithmic randomness

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