Notes on degrees of relative computable categoricity

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the possible degrees of relative computable categoricity by the oracle 0". In the case of rigid structures the bound is in fact 0'. These estimations are precise, in particular we can build a computable structure which is relatively computably categorical only in the degrees above 0"

Degrees of categoricity and spectral dimension

© 2018 The Association for Symbolic Logic. A Turing degree d is the degree of categoricity of a computable structure S if d is the least degree capable of computing isomorphisms among arbitrary computable copies of S. A degree d is the strong degree of categoricity of S if d is the degree of categoricity of S, and there are computable copies A and B of S such that every isomorphism from A onto B computes d. In this paper, we build a c.e. degree d and a computable rigid structure Msuch that d is the degree of categoricity of M, but d is not the strong degree of categoricity of M. This solves the open problem of Fokina, Kalimullin, andMiller [13]. For a computable structure S, we introduce the notion of the spectral dimension of S, which gives a quantitative characteristic of the degree of categoricity of S. We prove that for a nonzero natural number N, there is a computable rigid structureMsuch that 0 is the degree of categoricity ofM, and the spectral dimension ofMis equal to N

Many Problems, Different Frameworks: Classification of Problems in Computable Analysis and Algorithmic Learning Theory

In this thesis, we study the complexity of some mathematical problems, in particular those arising in \emph{computable analysis} and \emph{algorithmic learning theory for algebraic structures}. We highlight that our study is not limited to these two areas: indeed, in both cases, the results we obtain are tightly connected to ideas and tools coming from different areas of mathematical logic, including for example descriptive set theory and reverse mathematics. After giving the necessary preliminaries, the rest of the thesis is divided into two parts one concerning computable analysis and the other algorithmic learning theory for algebraic structures. In the first part we start studying the uniform computational strength of the Cantor-Bendixson theorem in the Weihrauch lattice. This work falls into the program connecting reverse mathematics and computable analysis via the framework of Weihrauch reducibility. We concentrate on problems related to perfect subsets of Polish spaces, studying the perfect set theorem, the Cantor-Bendixson theorem, and various problems arising from them. In the framework of reverse mathematics, these theorems are equivalent respectively to $\mathsf{ATR}_0$ and \PiCA and, as far as we know, this is the first systematic study of problems at the level of \PiCA in the Weihrauch lattice. We show that the strength of some of the problems we study depends on the topological properties of the Polish space under consideration, while others have the same strength once the space is rich enough. The first part continues considering problems related to (induced) subgraphs. We provide results on the (effective) Wadge complexity of sets of graphs, that are also used to determine the Weihrauch degree of certain decision problems. The decision problems we consider are defined for a fixed graph $G$, and they take as input a graph $H$, answering whether $G$ is an (induced) subgraph of $H$: we also consider the opposite problem (i.e.\ answering whether $H$ is an induced subgraph of $G$). Our study in this context is not limited to decision problems, and we also study the Weihrauch degree of problems that, for a fixed graph $G$ and given in input a graph $H$ such that $G$ is an (induced) subgraph $H$, they output a copy of $G$ in $H$. In both cases, we highlight differences and analogies between the subgraph and the induced subgraph relation. In the second part, we introduce algorithmic learning theory, and we present the framework we use to study the learnability of families of algebraic structures: here, given a countable family of pairwise nonisomorphic structures \K, a learner receives larger and larger pieces of an arbitrary copy of a structure in \K and, at each stage, is required to output a conjecture about the isomorphism type of such a structure. We say that \K is learnable if there exists a learner which eventually stabilizes to a correct guess. The framework was lacking a method for comparing the complexity of nonlearnable families, and so we propose a solution to this problem using tools coming from invariant descriptive set theory. To do so, we first prove that a family of structures is learnable if and only if its learning domain is continuously reducible to the relation $E_0$ of eventual agreement on infinite binary sequences and then, replacing $E_0$ with Borel equivalence relations of higher complexity, we obtain a new hierarchy of learning problems. This leads to the notion of \emph{$E$-learnability}, where a family of structures \K is {$E$-learnable}, for a Borel equivalence relation $E$, if there is a continuous reduction from the isomorphism relation associated with \K to $E$. It is then natural to ask how the notion of $E$-learnability interacts with "classical" learning paradigms. We conclude the second part (and the overall thesis) studying the number of mind changes that a learner needs to learn a given family, both from a topological and a combinatorial point of view