Related papers: A $wtt$-introimmune set in \texorpdfstring{$\Pi^0_…
We prove various results connected together by the common thread of computability theory. First, we investigate a new notion of algorithmic dimension, the inescapable dimension, which lies between the effective Hausdorff and packing…
In a previous paper, the author introduced the idea of intrinsic density --- a restriction of asymptotic density to sets whose density is invariant under computable permutation. We prove that sets with well-defined intrinsic density (and…
A set of infinite binary sequences $\mathcal{C}\subseteq2^\omega$ is negligible if there is no partial probabilistic algorithm that produces an element of this set with positive probability. The study of negligibility is of particular…
Answering an open question raised by Cooper, we show that there exist $\Delta^0_2$ sets $D$ and $E$ such that the singleton degree of $E$ is a minimal cover of the singleton degree of $D$. This shows that the $\Sigma^{0}_{2}$ singleton…
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…
We investigate issues surrounding an old question of Yates' as to the existence of a minimal Turing degree with no strong minimal cover, specifically with respect to the hyperimmune-free degrees.
In 2012, inspired by developments in group theory and complexity, Jockusch and Schupp introduced generic computability, capturing the idea that an algorithm might work correctly except for a vanishing fraction of cases. However, we observe…
The notion of weak truth-table reducibility plays an important role in recursion theory. In this paper, we introduce an elaboration of this notion, where a computable bound on the use function is explicitly specified. This elaboration…
An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…
We consider the singular $SU(3)$ Toda system with multiple singular sources \begin{align*} \left\{\begin{array}{ll}-\Delta w_1=2e^{2w_1}-e^{w_2}+2\pi\sum_{\ell=1}^m\beta_{1,\ell}\delta_{P_{\ell}}\quad\text{in }\mathbb{R}^2\\…
A non-empty subset of a topological space is irreducible if whenever it is covered by the union of two closed sets, then already it is covered by one of them. Irreducible sets occur in proliferation: (1) every singleton set is irreducible,…
We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…
We give solutions to two of the questions in a paper by Brendle, Brooke-Taylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we…
We show that there exists a non-empty special $\Pi^0_1$ class in which no member is a minimal cover for any set, hence prove that degrees of minimal covers cannot be a basis for $\Pi^0_1$ classes.
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…
We provide the first evidence for the inherent difficulty of finding complex sets with optimal proof systems. For this, we construct oracles $O_1$ and $O_2$ with the following properties, where $\mathrm{RE}$ denotes the class of recursively…
We identify a notion of reducibility between predicates, called instance reducibility, which commonly appears in reverse constructive mathematics. The notion can be generally used to compare and classify various principles studied in…
Let $\beta_1,\beta_2>1$ and $T_i(x,y) = \bigl(\frac{x+i}{\beta_1}, \frac{y+i}{\beta_2}\bigr),\ i\in\{\pm1\}$. Let $A := A_{\beta_1, \beta_2}$ be the unique compact set satisfying $A = T_{1}(A) \cup T_{-1}(A)$. In this paper we give a…
The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…
We define $\Psi$-autoreducible sets given an autoreduction procedure $\Psi$. Then, we show that for any $\Psi$, a measurable class of $\Psi$-autoreducible sets has measure zero. Using this, we show that classes of cototal, uniformly…