Impugning Randomness, Convincingly

被引：0
|
作者：
Yuri Gurevich
Grant Olney Passmore
机构：
[1] Microsoft Research,
[2] One Microsoft Way,undefined
[3] Clare Hall,undefined
[4] University of Cambridge and LFCS,undefined
[5] University of Edinburgh,undefined
来源：
Studia Logica | 2012年 / 100卷
关键词：
information complexity; randomness; definability; Cournot’s Principle;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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
页数：29
相关论文
共 50 条
  • [1] Impugning Randomness, Convincingly
    Gurevich, Yuri
    Passmore, Grant O.
    STUDIA LOGICA, 2012, 100 (1-2) : 193 - 222
  • [2] Randomness? What Randomness?
    Klaas Landsman
    Foundations of Physics, 2020, 50 : 61 - 104
  • [3] Randomness? What Randomness?
    Landsman, Klaas
    FOUNDATIONS OF PHYSICS, 2020, 50 (02) : 61 - 104
  • [4] An investigation of the randomness using the randomness rate
    Yang, JG
    Wang, ZA
    We, XZ
    Goykadosh, A
    Li, LH
    Li, QF
    Lo, Y
    8TH WORLD MULTI-CONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL III, PROCEEDINGS: COMMUNICATION AND NETWORK SYSTEMS, TECHNOLOGIES AND APPLICATIONS, 2004, : 146 - 151
  • [5] On randomness
    Cohen, Imogen
    TARGET-INTERNATIONAL JOURNAL OF TRANSLATION STUDIES, 2018, 30 (01) : 3 - 23
  • [6] Dealing With Randomness
    Osterloh, Margit
    Frey, Bruno S.
    MANAGEMENT REVUE, 2019, 30 (04) : 331 - 345
  • [7] Randomness and Semimeasures
    Bienvenu, Laurent
    Hoelzl, Rupert
    Porter, Christopher P.
    Shafer, Paul
    NOTRE DAME JOURNAL OF FORMAL LOGIC, 2017, 58 (03) : 301 - 328
  • [8] About Randomness
    Hogenova, Anna
    CONTINGENCY IN THE EDUCATION, ART AND SPORT, 2017, : 7 - 19
  • [9] Randomness in cryptography
    Gennaro, R
    IEEE SECURITY & PRIVACY, 2006, 4 (02) : 64 - 67
  • [10] Randomness is hard
    Buhrman, H
    Torenvliet, L
    SIAM JOURNAL ON COMPUTING, 2000, 30 (05) : 1485 - 1501
12345