Main Page | See live article | Alphabetical index

Supertask

In mathematics and philosophy, a supertask is a task involving an infinite number of steps, completed in a finite amount of time. The term supertask was coined by Thompson.

Examples of supertasks:

Some philosophical issues of supertasks include: If supertasks are physically possible, then the truth or falsehood of unknown propositions of number theory, such as Goldbach's conjecture, could be determined in a finite amount of time by a brute force search of the set of all natural numbers. Hence, all propositions of arithmetic would be decidable.

In computer science, it has a different, unrelated meaning [1].

External References