Contribution to Book
Infinite Time Turing Machines and an Application to the Hierarchy of Equivalence Relations on the RealsEffective Mathematics of the Uncountable (2013)
Coskey and Hamkins show what happens if one lets Turing machines run beyond forever; that is, if computations of Turing machines run for an ordinal amount of time. These machines can then be used to compute subsets of Cantor space 2ω, by writing entire reals on the input tape.
EditorNoam Greenberg, Joel David Hamkins, Denis Hirschfeldt and Russell Miller
PublisherCambridge University Press
Citation InformationSamuel Coskey and Joel David Hamkins. "Infinite Time Turing Machines and an Application to the Hierarchy of Equivalence Relations on the Reals" CambridgeEffective Mathematics of the Uncountable (2013)
Available at: http://works.bepress.com/samuel_coskey/10/