Sterkenburg, Tom F. (2018) Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine. Erkenntnis.
This is the latest version of this item.
|
Text
solput.pdf - Accepted Version Download (424kB) | Preview |
Abstract
Putnam construed the aim of Carnap's program of inductive logic as the specification of a "universal learning machine," and presented a diagonal proof against the very possibility of such a thing. Yet the ideas of Solomonoff and Levin lead to a mathematical foundation of precisely those aspects of Carnap’s program that Putnam took issue with, and in particular, resurrect the notion of a universal mechanical rule for induction.
In this paper, I take up the question whether the Solomonoff–Levin proposal is successful in this respect. I expose the general strategy to evade Putnam's argument, leading to a broader discussion of the outer limits of mechanized induction. I argue that this strategy ultimately still succumbs to diagonalization, reinforcing Putnam’s impossibility claim.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Item Type: | Published Article or Volume | ||||||
---|---|---|---|---|---|---|---|
Creators: |
|
||||||
Subjects: | Specific Sciences > Computation/Information General Issues > Confirmation/Induction |
||||||
Depositing User: | Mr Tom Sterkenburg | ||||||
Date Deposited: | 11 Oct 2018 17:22 | ||||||
Last Modified: | 11 Oct 2018 17:22 | ||||||
Item ID: | 15137 | ||||||
Journal or Publication Title: | Erkenntnis | ||||||
DOI or Unique Handle: | https://doi.org/10.1007/s10670-018-9975-x | ||||||
Subjects: | Specific Sciences > Computation/Information General Issues > Confirmation/Induction |
||||||
Date: | 2018 | ||||||
URI: | https://philsci-archive.pitt.edu/id/eprint/15137 |
Available Versions of this Item
-
Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine. (deposited 16 May 2016 15:52)
-
Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine. (deposited 06 Jan 2017 14:52)
- Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine. (deposited 11 Oct 2018 17:22) [Currently Displayed]
-
Putnam's Diagonal Argument and the Impossibility of a Universal Learning Machine. (deposited 06 Jan 2017 14:52)
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Altmetric.com
Actions (login required)
View Item |