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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

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.
Computable randomness and betting for computable probability spaces.Jason Rute - 2016 - Mathematical Logic Quarterly 62 (4-5):335-366.
Mathematical foundations of randomness.Abhijit Dasgupta - 2011 - In Prasanta S. Bandyopadhyay & Malcolm Forster (eds.), Handbook of the Philosophy of Science, Vol. 7: Philosophy of Statistics. Elsevier B.V.. pp. 641-710.
On partial randomness.Cristian S. Calude, Ludwig Staiger & Sebastiaan A. Terwijn - 2006 - Annals of Pure and Applied Logic 138 (1):20-30.
Hume's Definitions of "Cause".William Neal Zulch - 1984 - Dissertation, The Johns Hopkins University
Weyl on Fregean Implicit Definitions: Between Phenomenology and Symbolic Construction.Demetra Christopoulou - 2014 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 45 (1):35-47.

Analytics

Added to PP
2021-02-23

Downloads
52 (#418,263)

6 months
20 (#146,291)

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.

View all 22 references / Add more references