All switches complete by t=2 minutes.
At t=2, is the lamp ON or OFF?
It can't be ON – every ON was followed by OFF!
It can't be OFF – every OFF was followed by ON!
After infinitely many switches... is the lamp ON or OFF?
In 1954, British philosopher James F. Thomson devised this thought experiment to analyze supertasks—the completion of infinitely many tasks in finite time.
The switching times form a geometric series: 1 + 0.5 + 0.25 + 0.125 + ... = 2 minutes. After exactly 2 minutes, infinitely many switches have occurred.
| Argument | Conclusion | Problem |
|---|---|---|
| Every ON is followed by OFF | Can't end ON | There's no "last" switch! |
| Every OFF is followed by ON | Can't end OFF | Same problem in reverse! |
| Lamp must be ON or OFF | Contradiction! | ??? |
If we represent ON = 1 and OFF = 0, the lamp's state at any moment before t=2 is:
This is Grandi's series, which famously has no standard sum:
The sequence of partial sums is 1, 0, 1, 0, 1, 0... which oscillates forever and does not converge to any value.
Philosopher Paul Benacerraf (1962) argued that Thomson's lamp is not truly paradoxical—it's simply underspecified.
The supertask defines the lamp's state at every time before t=2, but nothing in the setup logically determines its state at t=2. The final state is simply not entailed by the infinite sequence of switches.
Unlike the Ross-Littlewood paradox (balls in a vase), Thomson's lamp has no definite mathematical answer:
| Paradox | Question | Answer |
|---|---|---|
| Ross-Littlewood | How many balls at noon? | 0 (each ball n removed at step n) |
| Thomson's Lamp | Is lamp on or off at t=2? | Undetermined (no convergent limit) |
The difference: in Ross-Littlewood, we can trace each ball's fate. In Thomson's lamp, the ON/OFF sequence has no limit—the question is meaningless without additional assumptions about what happens at t=2.