Impugning Randomness, Convincingly

被引：1

作者：

Gurevich, Yuri ^{[1
]}

Passmore, Grant O. ^{[2
,3
]}

机构：

[1] Microsoft Res, Redmond, WA 98052 USA

[2] Univ Cambridge, Cambridge CB3 9AL, England

[3] Univ Edinburgh, LFCS, Cambridge CB3 9AL, England

来源：

STUDIA LOGICA | 2012年 / 100卷 / 1-2期

关键词：

information complexity; randomness; definability; Cournot's Principle; COMPRESSION; INFORMATION; SIMILARITY; SEQUENCES; DISTANCE;

D O I：

10.1007/s11225-012-9375-1

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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.

引用

页码：193 / 222

页数：30

共 54 条

[31] THE STRENGTH OF WEAK TIES [J].