The Equivalence of Definitions of Algorithmic Randomness

Philosophia Mathematica 29 (2):153–194 (2021)
  Copy   BIBTEX

Abstract

In this paper, I evaluate the claim that the equivalence of multiple intensionally distinct definitions of random sequence provides evidence for the claim that these definitions capture the intuitive conception of randomness, concluding that the former claim is false. I then develop an alternative account of the significance of randomness-theoretic equivalence results, arguing that they are instances of a phenomenon I refer to as schematic equivalence. On my account, this alternative approach has the virtue of providing the plurality of definitions of randomness with conceptual unity and a rationale for certain investigations that are carried out in the field.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,853

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Chance versus Randomness.Antony Eagle - 2010 - Stanford Encyclopedia of Philosophy.
Demuth’s path to randomness.Antonín Kučera, André Nies & Christopher P. Porter - 2015 - Bulletin of Symbolic Logic 21 (3):270-305.
On partial randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
How much randomness is needed for statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux & Neil Thapen - 2014 - Annals of Pure and Applied Logic 165 (9):1470-1483.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Continuous higher randomness.Laurent Bienvenu, Noam Greenberg & Benoit Monin - 2017 - Journal of Mathematical Logic 17 (1):1750004.
Randomness and Semimeasures.Laurent Bienvenu, Rupert Hölzl, Christopher P. Porter & Paul Shafer - 2017 - Notre Dame Journal of Formal Logic 58 (3):301-328.
Determinism.Charlotte Werndl - 2016 - In Meghan Griffith, Kevin Timpe & Neil Levy (eds.), Routledge Companion to Free Will. Routledge.
Hume's Definitions of "Cause".William Neal Zulch - 1984 - Dissertation, The Johns Hopkins University
Abductive Equivalence in First-order Logic.Katsumi Inoue & Chiaki Sakama - 2006 - Logic Journal of the IGPL 14 (2):333-346.
Randomness notions and reverse mathematics.André Nies & Paul Shafer - 2020 - Journal of Symbolic Logic 85 (1):271-299.

Analytics

Added to PP
2021-02-23

Downloads
28 (#569,665)

6 months
11 (#237,876)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Christopher Porter
Drake University

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
An Introduction to Gödel's Theorems.Peter Smith - 2009 - Bulletin of Symbolic Logic 15 (2):218-222.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press.

View all 24 references / Add more references