Impugning Randomness, Convincingly

Authors:
Yuri Gurevich;Grant Olney Passmore
Affiliations:
Microsoft Research, One Microsoft Way, Redmond, USA 98052;Clare Hall, University of Cambridge and LFCS, University of Edinburgh, Cambridge, UK CB3 9AL
Venue:
Studia Logica
Year:
2012

Citing 13
Cited 0

Randomness conservation inequalities; information and independence in mathematical theories

Information and Control
Algorithmic information theory

Algorithmic information theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
On the Length of Programs for Computing Finite Binary Sequences

Journal of the ACM (JACM)
Measuring the similarity of protein structures by means of the universal similarity metric

Bioinformatics
Algorithmic Clustering of Music Based on String Compression

Computer Music Journal
Markov logic networks

Machine Learning
The Google Similarity Distance

IEEE Transactions on Knowledge and Data Engineering
A Technique for High-Performance Data Compression

Computer
Finite state complexity

Theoretical Computer Science
A universal algorithm for sequential data compression

IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding

IEEE Transactions on Information Theory
Shared information and program plagiarism detection

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.