Infinite-Time Turing Machines and Borel Reducibility

@inproceedings{Coskey2009InfiniteTimeTM,
  title={Infinite-Time Turing Machines and Borel Reducibility},
  author={Samuel Coskey},
  booktitle={CiE},
  year={2009}
}
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. 

Transfinite machine models

  • P. Welch
  • Computer Science
    Turing's Legacy
  • 2014
Considerations of what may lay on an output tape at an infinite stage first surface in the notion of ‘computation in the limit’ or ‘limit decidable’ are considered.

The Lost Melody Phenomenon

It is proved that, for unresetting infinite time register machines introduced by P. Koepke, recognizability equals computability, i.e. the lost melody phenomenon does not occur.

References

SHOWING 1-10 OF 10 REFERENCES

P != NP cap co-NP for Infinite Time Turing Machines

It is established in the context of infinite time Turing machines that P is properly contained in NP ∩ co-NP and higher analogues of these classes exhibit positive and negative results.

Infinite Time Turing Machines

Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical

A Borel reductibility theory for classes of countable structures

Abstract We introduce a reducibility preordering between classes of countable structures, each class containing only structures of a given similarity type (which is allowed to vary from class to

Linear algebraic groups and countable Borel equivalence relations

This paper is a contribution to the study of Borel equivalence relations on standard Borel spaces (i.e., Polish spaces equipped with their Borel structure). In mathematics one often deals with

Countable Borel Equivalence Relations

This paper develops the foundations of the descriptive set theory of countable Borel equivalence relations on Polish spaces with particular emphasis on the study of hyper-finite, amenable, treeable

Borel Equivalence Relations and Classifications of Countable Models

Minimality Arguments for Infinite Time Turing Degrees

Property τ and Countable Borel Equivalence Relations

For each prime q, it is proved that the orbit equivalence relations arising from the natural actions of SL2(ℤ[1/q]) on the projective lines over the various p-adic fields are pairwise incomparable with respect to Borel reducibility.

P ̸= NP∩co-NP for infinite time turing machines

  • 2005

Countable Borel equivalence relations. Online somewhere

  • Countable Borel equivalence relations. Online somewhere
  • 2007