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

DOI10.1007/S00224-010-9300-9zbMath1283.68179OpenAlexW2028313666MaRDI QIDQ692926

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

algorithmic information theoryTuring degreesBernoulli sequencesA priory semimeasureMartin-Löf random sequencesparametric families of probability distributionsprobabilistic machines

Mathematics Subject Classification ID

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

Related Items (1)

DEGREES OF RANDOMIZED COMPUTABILITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A formal theory of inductive inference. Part I

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