The universality of polynomial time Turing equivalence
Logic
2016-07-20 v2
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.
Keywords
Cite
@article{arxiv.1601.03343,
title = {The universality of polynomial time Turing equivalence},
author = {Andrew S. Marks},
journal= {arXiv preprint arXiv:1601.03343},
year = {2016}
}
Comments
Minor corrections