Related papers: Pi01 encodability and omniscient reductions

A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

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 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…

Given two combinatorial notions $\mathsf{P}_0$ and $\mathsf{P}_1$, can we encode $\mathsf{P}_0$ via $\mathsf{P}_1$. In this talk we address the question where $\mathsf{P}_0$ is 3-coloring of integers and $\mathsf{P}_1$ is product of…

A cohesive power of a computable structure is an effective ultrapower where a cohesive set acts as an ultrafilter. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and the rationals.…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

Effective versions of strong measure zero sets are developed for various levels of complexity and computability. It is shown that the sets can be equivalently defined using a generalization of supermartingales called odds supermartingales,…

Working over infinite dimensional separable Hilbert spaces, residual results have been achieved for the space of contractive $C_{0}$-semigroups under the topology of uniform weak operator convergence on compact subsets of $\mathbb{R}_{+}$.…

We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's $\mathbb{T}$. We show that computably compact computable metric spaces admit representations of their compact subsets in such a…

We prove that if $A$ is a computable Hopfian finitely presented structure, then $A$ has a computable $d$-$\Sigma_2$ Scott sentence if and only if the weak Whitehead problem for $A$ is decidable. We use this to infer that every hyperbolic…

Irreducible skew-Berger algebras $\g\subset\gl(n,\Co)$, i.e. algebras spanned by the images of the linear maps $R:\odot^2\Co^n\to\g$ satisfying the Bianchi identity, are classified. These Lie algebras can be interpreted as irreducible…

Given a countable mathematical structure, its Scott sentence is a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ that characterizes it among all countable structures. We can measure the complexity of a structure by the…

The main result is the following. Let $f \colon X \rightarrow Y$ be a continuous mapping of a completely Baire space $X$ onto a hereditary weakly Preiss-Simon regular space $Y$ such that the image of every open subset of $X$ is a resolvable…