We consider the theory of supertasks as implemented on infinite time Turing machines. We consider in particular computations in the type of sets of reals. We give some commentary on this and a number of open problems are raised.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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
Welch, P.D. (2004). Post's and other problems of supertasks of higher type. 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_13
Download citation
DOI: https://doi.org/10.1007/978-1-4020-2776-5_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2775-8
Online ISBN: 978-1-4020-2776-5
eBook Packages: Springer Book Archive