Infinite time Turing machines extend the classical Turing machine concept to transfinite ordinal time, thereby providing a natural model of infinitary computability that sheds light on the power and limitations of supertask algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Hamkins, J.D. (2004). Supertask computation. In: Löwe, B., Piwinger, B., Räsch, T. (eds) Classical and New Paradigms of Computation and their Complexity Hierarchies. Trends in Logic, vol 23. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2776-5_8
Download citation
DOI: https://doi.org/10.1007/978-1-4020-2776-5_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2775-8
Online ISBN: 978-1-4020-2776-5
eBook Packages: Springer Book Archive