On empirical meaning of randomness with respect to parametric families of probability distributions

DOI10.1007/S00224-010-9300-9MaRDI QIDQ692926zbMATH OpenOpenAlexFDO

Authors Vladimir V. V'yugin

Publication date 6 December 2012

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-010-9300-9

zbMATH Keywords

Turing degreesalgorithmic information theoryBernoulli sequencesA priory semimeasure[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Martin-L%EF%BF%BD%EF%BF%BDf+random+sequences&go=Go Martin-L��f random sequences]parametric families of probability distributionsprobabilistic machines

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• On Empirical Meaning of Randomness with Respect to a Real Parameter
• On the asymptotics of randomness statistics
• A new derivation of the randomness parameter
• Properties of some distributions in randomization theory
• On properties of empirical and related random processes
• scientific article; zbMATH DE number 5287633
• Randomness Criteria in Terms of $ {\alpha }$-Divergences
• On a family of indeterminate distributions
• On the significands of uniform random variables

Cites work

• scientific article; zbMATH DE number 3489016 (Why is no real title available?)
• scientific article; zbMATH DE number 3522963 (Why is no real title available?)
• scientific article; zbMATH DE number 3559552 (Why is no real title available?)
• scientific article; zbMATH DE number 1199736 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A formal theory of inductive inference. Part I
• Randomness conservation inequalities; information and independence in mathematical theories
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The definition of random sequences

Cited in

(3)

• Algorithmic identification of probabilities is hard
• Degrees of randomized computability
• The probability distribution as a computational resource for randomness testing

This page was built for publication: On empirical meaning of randomness with respect to parametric families of probability distributions

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