Skip to main content
eScholarship
Open Access Publications from the University of California

UCLA

UCLA Previously Published Works bannerUCLA

The universality of polynomial time Turing equivalence

  • Author(s): Marks, Andrew
  • et al.
Abstract

We show that polynomial time Turing equivalence and a large class of other equivalence relations from computational complexity theory are universal countable Borel equivalence relations. We then discuss ultrafilters on the invariant Borel sets of these equivalence relations which are related to Martin's ultrafilter on the Turing degrees.

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content
Current View