Andrew S. Marks
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and order. Afterwards, we combine the results from our study of these sets as orders with a classical construction from Avraham to obtain a restriction about how non trivial automorphism of the Turing degrees (if they exist) interact with $1$-generic degrees.
A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in recursion theory are: recursive isomorphism, Turing equivalence, arithmetic equivalence, etc. There is a canonical hierarchy of complexity of countable Borel equivalence relations imposed by the notion of Borel reducibility. We will survey results and conjectures concerning the problem of identifying the place in this hierarchy of these equivalence relations from…
We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the application of infinite time Turing machines to the analysis of the hierarchy of equivalence relations on the reals, in analogy with the theory arising from Borel reducibility. We define a notion of infinite time reducibility, which lifts much of the Borel theory into the class $\bmΔ^1_2$ in a satisfying way.
We study functions from reals to reals which are uniformly degree-invariant from Turing-equivalence to many-one equivalence, and compare them "on a cone." We prove that they are in one-to-one correspondence with the Wadge degrees, which can be viewed as a refinement of the uniform Martin's conjecture for uniformly invariant functions from Turing- to Turing-equivalence. Our proof works in the general case of many-one degrees on $\mathcal{Q}^ω$ and Wadge degrees of functions $ω^ω\to\mathcal{Q}$ for any better quasi ordering $\mathcal{Q}$.
We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of countable groups. We begin by investigating the notion of uniform universality, first proposed by Montalbán, Reimann and Slaman. This notion is a strengthened form of a countable Borel equivalence relation being universal, which we conjecture is equivalent to the usual notion. With this additional uniformity hypothesis, we can answer many questions concerning …
Turing universality, computability, and incompleteness in hypergraph Turán theory
该研究证明超图Turán理论的核心问题可编码任意计算，其相关的极值结构性质及等式的可证性均具有不可判定性与独立性，改进见证呈忙海狸增长。
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and bi-reducibility. These spectra provide a natural way of measuring the complexity of reductions between equivalence relations. We prove that any upward closed collection of Turing degrees with a countable basis can be realised as a reducibility spectrum or as a bi-reducibility spectrum. We show also that there is a reducibility spectrum of computably enumerable…
We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second author to show that these equivalence relations are invariantly universal, in the sense of [3], and thus in particular complete analytic. We also introduce a new kind of Borel reducibility relation for standard Borel G-spaces, which requires the preservation of stabilizers, and explain its connection with the notion of full embeddings commonly considered in c…
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem in recursion theory has connected to many problems in descriptive set theory, particularly in the theory of countable Borel equivalence relations. In this paper, we shall give an overview of some work that has been done on Martin's conjecture, and applications that it has had in descriptive set theory. We will present a long unpublished result of Slaman and…
We introduce an analog of the theory of Borel equivalence relations in which we study equivalence relations that are decidable by an infinite time Turing machine. The Borel reductions are replaced by the more general class of infinite time computable functions. Many basic aspects of the classical theory remain intact, with the added bonus that it becomes sensible to study some special equivalence relations whose complexity is beyond Borel or even analytic. We also introduce an infinite time generalization of the countable Borel equivalence relations, a key subclass of the Borel equivalence rel…
On a question of Slaman and Steel
本文探讨了Slaman和Steel关于图灵等价是否可分解为不包含可计算无限序列的可测等价关系的递增并集的问题，并将其与Martin猜想及可数可测等价关系联系起来。
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy \lra f(x) Sf(y)]. $ Here $f$ is taken from a suitable class of effective functions. For us the relations will be on natural numbers, and $f$ must be computable. We show that there is a $Π_1$-complete equivalence relation, but no $Πk$-complete for $k \ge 2$. We show that $Σk$ preorders arising naturally in the above-mentioned areas are $Σk$-complete. This incl…
We show that every abelian Polish group is the topological factor-group of a closed subgroup of the full unitary group of a separable Hilbert space with the strong operator topology. It follows that all orbit equivalence relations induced by abelian Polish group actions are Borel reducible to some orbit equivalence relations induced by actions of the unitary group.
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on $ω$ is above equality on ${\cal P}(ω)$, the power set of $ω$, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on ${\cal P}(ω)$. In this article we examine the effective content of these and related results by studying effectively Borel equivalence relat…
Orbit pseudometrics and a universality property of the Gromov-Hausdorff distance
本文研究标准Borel空间上伪度量的Borel可归约性与轨道伪度量概念，证明波兰度量空间的Gromov-Hausdorff距离与某类轨道伪度量的泛元双可归约。
We introduce the notion of an invariantly universal pair (S,E) where S is an analytic quasi-order and E \subseteq S is an analytic equivalence relation. This means that for any analytic quasi-order R there is a Borel set B invariant under E such that R is Borel bireducible with the restriction of S to B. We prove a general result giving a sufficient condition for invariant universality, and we demonstrate several applications of this theorem by showing that the phenomenon of invariant universality is widespread. In fact it occurs for a great number of complete analytic quasi-orders, arising in…
Realizations of countable Borel equivalence relations
本文研究可数Borel等价关系的拓扑实现，涵盖连续群作用、极小子移位及普适空间中的性质刻画，并探讨Turing等价等特殊关系的实现问题。
For a ring $R$, Hilbert's Tenth Problem $HTP(R)$ is the set of polynomial equations over $R$, in several variables, with solutions in $R$. We view $HTP$ as an operator, mapping each set $W$ of prime numbers to $HTP(\mathbb Z[W^{-1}])$, which is naturally viewed as a set of polynomials in $\mathbb Z[X_1,X_2,\ldots]$. For $W=\emptyset$, it is a famous result of Matiyasevich, Davis, Putnam, and Robinson that the jump $\emptyset~\!'$ is Turing-equivalent to $HTP(\mathbb Z)$. More generally, $HTP(\mathbb Z[W^{-1}])$ is always Turing-reducible to $W'$, but not necessarily equivalent. We show here th…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。