scientific article; zbMATH DE number 6019540

MaRDI QIDQ3224094zbMATH OpenFDO

Authors Serge Grigorieff, Marie C. Ferbus-Zanda

Publication date 29 March 2012

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

zbMATH Keywords

Kolmogorov complexityrandom sequencerandom string

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5851986
• The Power and Weakness of Randomness in Computation
• Randomness -- a computational complexity perspective
• Randomness – A Computational Complexity Perspective
• Randomness and Computability: Open Questions
• Computable randomness is about more than probabilities
• Introducing Quasirandomness to Computer Science
• Algorithmic Randomness
• scientific article; zbMATH DE number 7377983
• Randomness and computation

Cited in

(2)

• Randomness, computation and mathematics
• Theoretical computer science: computational complexity

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