Skip to main content
Infinite-time Turing Machines and Borel Reducibility
Computability in Europe (2009)
  • Samuel Coskey, City University of New York

In this document I will outline a couple of recent developments, due to Joel Hamkins, Philip Welch and myself, in the theory of infinite-time Turing machines. These results were obtained with the idea of extending the scope of the study of Borel equivalence relations, an area of descriptive set theory. I will introduce the most basic aspects of Borel equivalence relations, and show how infinite-time computation may provide insight into this area.

Publication Date
July, 2009
Citation Information
Samuel Coskey. "Infinite-time Turing Machines and Borel Reducibility" Computability in Europe (2009)
Available at: