Supertasks and arithmetical truth
| Autor: | Jared Warren, Daniel Waxman |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Philosophy of mind
Determinacy Property (philosophy) Computer science Supertask 05 social sciences 06 humanities and the arts 0603 philosophy ethics and religion 050105 experimental psychology Philosophy of physics Decidability Philosophy of language Philosophy 060302 philosophy Arithmetic function 0501 psychology and cognitive sciences Mathematical economics |
| Zdroj: | Philosophical Studies. 177:1275-1282 |
| ISSN: | 1573-0883 0031-8116 |
| DOI: | 10.1007/s11098-019-01252-w |
| Popis: | This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if true, this implies that arithmetical truth is determinate (at least for e.g. sentences saying that every number has a certain decidable property). In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks are of no help in explaining arithmetical determinacy. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink