Impugning randomness, convincingly

DOI10.1007/s11225-012-9375-1zbMath1262.68054arXiv1601.00665OpenAlexW2017818707WikidataQ125936911 ScholiaQ125936911MaRDI QIDQ454396

Yuri Gurevich, Grant Olney Passmore

Publication date: 1 October 2012

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.00665

zbMATH Keywords

definabilityinformation complexityrandomnessCournot's principle

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of probability theory (60A99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Randomness Tests: Theory and Practice ⋮ The Fundamental Nature of the Log Loss Function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The miraculous universal distribution
• Markov logic networks
• Probability and Finance
• Weak Second‐Order Arithmetic and Finite Automata
• Shared Information and Program Plagiarism Detection
• Algorithmic Information Theory and Foundations of Probability
• Randomness conservation inequalities; information and independence in mathematical theories
• Algorithmic Information Theory
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• The Design Inference
• On the Length of Programs for Computing Finite Binary Sequences

This page was built for publication: Impugning randomness, convincingly