Related papers: Inherent enumerability of strong jump-traceability
Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…
We present a useful technique of proving strong $\mathfrak{c}$-algebrability. As an outcome we obtain the strong $\mathfrak{c}$-algebrability of the following sets of functions: strong Sierpi\'nski-Zygmund, nowhere H\"older, Bruckner-Garg,…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
We revisit the question (most famously) initiated by Turing: can human intelligence be completely modeled by a Turing machine? We show that the answer is \emph{no}, assuming a certain weak soundness hypothesis. More specifically we show…
We conduct a computability-theoretic study of Ramsey-like theorems of the form "Every coloring of the edges of an infinite clique admits an infinite sub-clique avoiding some pattern", with a particular focus on transitive patterns. As it…
We divide the class of infinite computable trees into three types. For the first and second types, $0'$ computes a nontrivial self-embedding while for the third type $0''$ computes a nontrivial self-embedding. These results are optimal and…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
An r.e. set $A$ is speedable if for every recursive function, there exists a program enumerating membership in $A$ faster, by the desired recursive factor, on infinitely many integers. We construct a speedable set that cannot be split into…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
The paper studies computability-theoretic aspects of topological $T_0$-spaces. We introduce effective versions of the notions of a countable $c$-poset and a (second-countable) topological space with base. Based on this, we prove an…
We show that there is a countable universal abelian p-group for purity, i.e., a countable abelian p-group $U$ such that every countable abelian p-group purely embeds in $U$. This is the last result needed to provide a complete solution to…
Recent efforts to learn reward functions from human feedback have tended to use deep neural networks, whose lack of transparency hampers our ability to explain agent behaviour or verify alignment. We explore the merits of learning…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…
We introduce a robust belief-based measure of complexity. The idea is that task A is deemed more complex than task B if the probability of solving A correctly is smaller than the probability of solving B correctly regardless of the reward.…
This thesis develops exact analytical tools to study strongly correlated stochastic systems, with a focus on extreme value statistics, gap statistics, and full counting statistics in multi-particle processes. A central contribution is the…