Croatian Journal of Philosophy 18 (3):479-485 (2018)

Davor Lauc
University of Zagreb
No-free-lunch theorems are important theoretical result in the fields of machine learning and artificial intelligence. Researchers in this fields often claim that the theorems are based on Hume’s argument about induction and represent a formalisation of the argument. This paper argues that this is erroneous but that the theorems correspond to and formalise Goodman’s new riddle of induction. To demonstrate the correspondence among the theorems and Goodman’s argument, a formalisation of the latter in the spirit of the former is sketched.
Keywords Analytic Philosophy  Contemporary Philosophy
Categories No categories specified
(categorize this paper)
ISBN(s) 1333-1108
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,579
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Intelligent Design and the NFL Theorems.Olle Häggström - 2007 - Biology and Philosophy 22 (2):217-230.
Simulation of Biological Evolution and the Nfl Theorems.Ronald Meester - 2009 - Biology and Philosophy 24 (4):461-472.
Gödel's Incompleteness Theorems and Computer Science.Roman Murawski - 1997 - Foundations of Science 2 (1):123-135.
Charting the Labyrinth of Bell-Type Theorems.Tomasz Placek - 1997 - Logic and Logical Philosophy 5:93-120.
Indirect-Deduction Theorems.S. J. Surma - 1967 - Studia Logica 20 (1):164-166.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861-878.
Weak Cardinality Theorems.Till Tantau - 2005 - Journal of Symbolic Logic 70 (3):861 - 878.
Inductive Learning by Machines.Stuart Russell - 1991 - Philosophical Studies 64 (October):37-64.


Added to PP index

Total views
13 ( #753,080 of 2,461,826 )

Recent downloads (6 months)
1 ( #448,803 of 2,461,826 )

How can I increase my downloads?


My notes