Indexed metadata

A PROOF OF THE IMPOSSIBILITY OF COMPLETING INFINITELY MANY TASKS

JEREMY GWIAZDA

Source record

Source: Crossref

Published: Mar 1, 2012

DOI: 10.1111/j.1468-0114.2011.01412.x

Open original source ↗

Source abstract

Abstract 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A PROOF OF THE IMPOSSIBILITY OF COMPLETING INFINITELY MANY TASKS — Mathematical Frontier Network