Category
page 1Hypercomputation
hypercomputation
Hypercomputation or super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that could solve the halting problem would be a hypercomputer; so too would one that could correctly evaluate every statement in Peano arithmetic.
Zeno machine
hypothetical computational model
supertask
A supertask is a 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.