Supertask

Supertasks are a hypothetical mechanism which can be used to simulate infinite time Turing machines and may be related to the divergence or convergence of infinite sums. Furthermore, supertasks can be used to draw matchstick diagrams for infinite ordinals.