Comparing notions of randomness

DOI10.1016/J.TCS.2009.09.036zbMATH Open1184.68274OpenAlexW1972906861MaRDI QIDQ844892FDOQ844892

Authors: Bart Kastermans, Steffen Lempp 

Publication date: 5 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.036

Recommendations

• On relative randomness
• scientific article; zbMATH DE number 1377777
• Randomness reexamined
• Randomness and hyper-randomness
• A note on randomness
• Comparing the independence of different random number generators
• scientific article; zbMATH DE number 969633
• Defining a randomness notion via another

zbMATH Keywords

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Martin-L%EF%BF%BD%EF%BF%BDf+randomness&go=Go Martin-L��f randomness]effective randomnessKolmogorov-Loveland randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• Algorithmic randomness and complexity.
• Process complexity and effective random tests
• Computability and randomness
• Kolmogorov-Loveland randomness and stochasticity
• A unified approach to the definition of random sequences
• Mathematical metaphysics of randomness
• A separation of two randomness concepts
• Randomness and Computability: Open Questions
• A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
• Title not available (Why is that?)

Cited In (6)

• Do stronger definitions of randomness exist?
• Some Questions in Computable Mathematics
• Theory of Cryptography
• Strong reductions in effective randomness
• Computable randomness and betting for computable probability spaces
• Probabilistic Algorithmic Randomness

This page was built for publication: Comparing notions of randomness

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