Impugning Randomness, Convincingly |
| |
Authors: | Yuri Gurevich Grant Olney Passmore |
| |
Affiliation: | 1. Microsoft Research, One Microsoft Way, Redmond, Washington, 98052, USA 2. Clare Hall, University of Cambridge and LFCS, University of Edinburgh, Herschel Road, Cambridge, CB3 9AL, UK
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|