Metainduction over Unboundedly Many Prediction Methods: A Reply to Arnold and Sterkenburg

Philosophy of Science 88 (2):320-340 (2021)
  Copy   BIBTEX

Abstract

The universal optimality theorem for metainduction works for epistemic agents faced with a choice among finitely many prediction methods. Eckhart Arnold and Tom Sterkenburg objected that it breaks...

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

Meta-Induction and the Wisdom of Crowds.Paul D. Thorn & Gerhard Schurz - 2012 - Analyse & Kritik 34 (2):339-366.
Optimisation in a Synchronised Prediction Setting.Christian J. Feldbacher-Escamilla - 2017 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 48 (3):419-437.
Solomonoff Prediction and Occam’s Razor.Tom F. Sterkenburg - 2016 - Philosophy of Science 83 (4):459-479.
Universal Prediction: A Philosophical Investigation.Tom F. Sterkenburg - 2018 - Dissertation, University of Groningen
Neville’s Ontological Creative Act: Two Interpretations.David Rohr - 2015 - American Journal of Theology and Philosophy 36 (2):168-189.
A Reply to Arnold's Reply.David Schweickart - 1987 - Economics and Philosophy 3 (2):331.

Analytics

Added to PP
2021-04-08

Downloads
44 (#361,171)

6 months
21 (#126,360)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gerhard Schurz
Heinrich Heine University Düsseldorf

Citations of this work

The problem of induction.John Vickers - 2008 - Stanford Encyclopedia of Philosophy.

Add more citations