Impugning randomness, convincingly

DOI10.1007/S11225-012-9375-1zbMATH Open1262.68054arXiv1601.00665OpenAlexW2017818707WikidataQ125936911 ScholiaQ125936911MaRDI QIDQ454396FDOQ454396

Authors: Yuri Gurevich, Grant Olney Passmore 

Publication date: 1 October 2012

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

Abstract: John organized a state lottery and his wife won the main prize. You may feel that the event of her winning wasn't particularly random, but how would you argue that in a fair court of law? Traditional probability theory does not even have the notion of random events. Algorithmic information theory does, but it is not applicable to real-world scenarios like the lottery one. We attempt to rectify that.

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

Recommendations

• Impugning randomness, convincingly
• Concurrent sequences of Bernoulli trials
• Randomness reexamined
• Randomness
• Some non-conventional ideas about algorithmic complexity

zbMATH Keywords

definabilityrandomnessinformation complexityCournot's principle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fundamentals of clinical trials.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The miraculous universal distribution
• Algorithmic Information Theory
• Compression of individual sequences via variable-rate coding
• Markov logic networks
• Probability and finance. It's only a game!
• A universal algorithm for sequential data compression
• On the Length of Programs for Computing Finite Binary Sequences
• Randomness conservation inequalities; information and independence in mathematical theories
• Weak Second‐Order Arithmetic and Finite Automata
• Title not available (Why is that?)
• Shared Information and Program Plagiarism Detection
• Algorithmic Information Theory and Foundations of Probability
• The Design Inference
• Title not available (Why is that?)

Cited In (4)

• The fundamental nature of the log loss function
• Impugning randomness, convincingly
• Randomness Tests: Theory and Practice
• Random resolution refutations

This page was built for publication: Impugning randomness, convincingly

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