Related papers: members of thin $\Pi_1^0$ classes and generic degr…
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 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…
We investigate what collections of c.e.\ Turing degrees can be realised as the collection of elements of a separating $\Pi^0_1$ class of c.e.\ degree. We show that for every c.e.\ degree $\mathbf{c}$, the collection $\{\mathbf{c},…
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.
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
We consider the question "Is every nonzero generic degree a density-1-bounding generic degree?" By previous results \cite{I2} either resolution of this question would answer an open question concerning the structure of the generic degrees:…
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set $A$ with non-trivial prefix-free initial segment…
We examine several notions of randomness for elements in a given $\Pi^0_1$ class $\mathcal{P}$. Such an effectively closed subset $\mathcal{P}$ of $2^\omega$ may be viewed as the set of infinite paths through the tree $T_{\mathcal{P}}$ of…
In this paper we are interested in computability aspects of subshifts and in particular Turing degrees of 2-dimensional SFTs (i.e. tilings). To be more precise, we prove that given any \pizu subset $P$ of $\{0,1\}^\NN$ there is a SFT $X$…
For integers $1\le \ell<k$, the $\ell$-degree Tur\'an density $\pi_\ell(F)$ measures the minimum $\ell$-degree threshold that forces a copy of a fixed $k$-uniform hypergraph $F$, generalizing both the classical Tur\'an density $\pi_1$ and…
A generic computation of a subset $A$ of $\mathbb{N}$ is a computation which correctly computes most of the bits of $A$, but which potentially does not halt on all inputs. The motivation for this concept is derived from complexity theory,…
On $X$ projective smooth over an algebraically closed field, we show that if Nori's fundamental group scheme is trivial, then there are no nontrivial Nori semistable bundles of degree 0, that is the group scheme $\pi^S(X)$ studied in…
In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$ there is a tileset $\tau$ with a set of configurations $C$ such that $P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a computable set of…
The Turing degree spectrum of a countable structure $\mathcal{A}$ is the set of all Turing degrees of isomorphic copies of $\mathcal{A}$. The Turing degree of the isomorphism type of $\mathcal{A}$, if it exists, is the least Turing degree…
It is well-known that any finite $\Pi^{0}_{1}$-class of $2^{\mathbb N}$ has a computable member. Then, how can we understand this in the context of reverse mathematics? In this note, we consider several very weak fragments of K\H{o}nig's…
We prove that there exists a countable infinite sequence of non-empty special $\Pi^0_1$ classes $\{\mathcal{P}_i\}_{i\in\omega}$ such that no infinite union of elements of any $\mathcal{P}_i$ computes the halting set. We then give a…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
The cohomology of the degree-$n$ general linear group over a finite field of characteristic $p$, with coefficients also in characteristic $p$, remains poorly understood. For example, the lowest degree previously known to contain nontrivial…
The degree spectrum of a countable structure is the set of all Turing degrees of presentations of that structure. We show that every nonlow Turing degree lies in the spectrum of some differentially closed field (of characteristic 0, with a…
We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group $G$ contains only two distinct values not divisible by a given prime number $p>3$, then $O^{pp'pp'}(G)=1$. This is done by…