ArticleslgStudy

computer science

Supertask

Supertask is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Supertask rather than just read about it. In short: A supertask is an at least countably infinite sequence of operations that occur sequentially within a finite interval of time. Supertasks are called hypertasks when the number of operations is uncountable.

Key takeaways

  • Supertask belongs to computer science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Supertask to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Supertask from memory before moving on to harder problems.

Reference excerpt

A supertask is an at least countably infinite sequence of operations that occur sequentially within a finite interval of time. Supertasks are called hypertasks when the number of operations is uncountable. A hypertask that includes one task for each ordinal number is called an ultratask. The term "supertask" was coined by the philosopher James F. Thomson, who devised Thomson's lamp. The term "hypertask" derives from Clark and Read in their paper of that name. In this literature, a "task" is taken to take a finite amount of time, and at any point in time, at most one task can be in progress. This then shows that hypertasks and ultratasks are impossible, since a finite interval cannot contain an uncountable number of finite intervals. This is because a closed and bounded interval is second-countable.

History

Zeno

Motion The origin of the interest in supertasks is normally attributed to Zeno of Elea. Zeno claimed that motion was impossible. He argued as follows: suppose our burgeoning "mover", Achilles say, wishes to move from A to B. To achieve this he must traverse half the distance from A to B. To get from the midpoint of AB to B, Achilles must traverse half this distance, and so on and so forth. However many times he performs one of these "traversing" tasks, there is another one left for him to do before he arrives at B. Thus it follows, according to Zeno, that motion (travelling a non-zero distance in finite time) is a supertask. Zeno further argues that supertasks are not possible (how can this sequence be completed if for each traversing there is another one to come?). It follows that motion is impossible. Zeno's argument takes the following form:

Motion is a supertask, because the completion of motion over any set distance involves an infinite number of steps Supertasks are impossible Therefore, motion is impossible Most subsequent philosophers reject Zeno's bold conclusion in favor of common sense. Instead, they reverse the argument and take it as a proof by contradiction where the possibility of motion is taken for granted. They accept the possibility of motion and apply modus tollens (contrapositive) to Zeno's argument to reach the conclusion that either motion is not a supertask or not all supertasks are impossible.

Achilles and the tortoise Zeno himself also discusses the notion of what he calls "Achilles and the tortoise". Suppose that Achilles is the fastest runner, and moves at a speed of 1 m/s. Achilles chases a tortoise, an animal renowned for being slow, that moves at 0.1 m/s. However, the tortoise starts 0.9 metres ahead. Common sense seems to decree that Achilles will catch up with the tortoise after exactly 1 second, but Zeno argues that this is not the case. He instead suggests that Achilles must inevitably come up to the point where the tortoise has started from, but by the time he has accomplished this, the tortoise will already have moved on to another point. This continues, and every time Achilles reaches the mark where the tortoise was, the tortoise will have reached a new point that Achilles will have to catch up with; while it begins with 0.9 metres, it becomes an additional 0.09 metres, then 0.009 metres, and so on, infinitely. While these distances will grow very small, they will remain finite, while Achilles' chasing of the tortoise will become an unending supertask. Much commentary has been made on this particular paradox; many assert that it finds a loophole in common sense.

Thomson

James F. Thomson believed that motion was not a supertask, and he emphatically denied that supertasks are possible. He considered a lamp that may either be on or off. At time t = 0 the lamp is off, and the switch is flipped on at t = 1/2; after that, the switch is flipped after waiting for half the time as before. Thomson asks what is the state at t = 1, when the switch has been flipped infinitely many times. He reasons that it cannot be on because there was never a time when it was not subsequently turned off, and vice versa, and reaches a contradiction. He concludes that supertasks are impossible.

Benacerraf Paul Benacerraf believes that supertasks are at least logically possible despite Thomson's apparent contradiction. Benacerraf agrees with Thomson insofar as that the experiment he outlined does not determine the state of the lamp at t = 1. However he disagrees with Thomson that he can derive a contradiction from this, since the state of the lamp at t = 1 cannot be logically determined by the preceding states.

Modern literature Most of the modern literature comes from the descendants of Benacerraf, those who tacitly accept the possibility of supertasks. Philosophers who reject their possibility tend not to reject them on grounds such as Thomson's but because they have qualms with the notion of infinity itself. Of course there are exceptions. For example, McLaughlin claims that Thomson's lamp is inconsistent if it is analyzed with internal set theory, a variant of real analysis.

Philosophy of mathematics If supertasks are possible, then the truth or falsehood of unknown propositions of number theory, such as Goldbach's conjecture, or even undecidable propositions could be determined in a finite amount of time by a brute-force search of the set of all natural numbers. This would, however, be in contradiction with the Church–Turing thesis. Some have argued this poses a problem for intuitionism, since the intuitionist must distinguish between things that cannot in fact be proven (because they are too long or complicated; for example Boolos's "Curious Inference") but nonetheless are considered "provable", and those which are provable by infinite brute force in the above sense.

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Supertask

Start with the simplest possible case. Write down what Supertask claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Supertask before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Supertask ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Supertask

In research
Supertask appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Supertask in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Supertask is common in secondary-school and first-year university syllabi. It links to neighbouring topics Concepts in logic, Hypercomputation, Supertasks, so understanding it makes those chapters shorter.
In everyday life
Look for Supertask outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Supertask in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Supertask means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Supertask out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Supertask in simple terms?

A supertask is an at least countably infinite sequence of operations that occur sequentially within a finite interval of time. Supertasks are called hypertasks when the number of operations is uncountable.

Why does Supertask matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Supertask?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Supertask.

Tags

  • Concepts in logic
  • Hypercomputation
  • Supertasks

Keep exploring