Contribution to Book
Infinite Time Turing Machines and an Application to the Hierarchy of Equivalence Relations on the Reals
Effective Mathematics of the Uncountable
(2013)
Abstract
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.
Disciplines
Publication Date
2013
Editor
Noam Greenberg, Joel David Hamkins, Denis Hirschfeldt and Russell Miller
Publisher
Cambridge University Press
ISBN
9781107496347
Publisher Statement
Effective Mathematics of the Uncountable is volume 41 of the Lecture Notes in Logic series.
Citation Information
Samuel 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/