A proof of the impossibility of completing infinitely many tasks

Download Edit this record How to cite View on PhilPapers
In this article, I argue that it is impossible to complete infinitely many tasks in a finite time. A key premise in my argument is that the only way to get to 0 tasks remaining is from 1 task remaining, when tasks are done 1-by-1. I suggest that the only way to deny this premise is by begging the question, that is, by assuming that supertasks are possible. I go on to present one reason why this conclusion (that supertasks are impossible) is important, namely that it implies a new verdict on a decision puzzle propounded by Jeffrey Barrett and Frank Arntzenius
No keywords specified (fix it)
(categorize this paper)
PhilPapers/Archive ID
Upload history
First archival date: 2013-03-03
Latest version: 2 (2013-03-07)
View other versions
Added to PP index

Total views
456 ( #16,270 of 69,149 )

Recent downloads (6 months)
26 ( #31,571 of 69,149 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.