Related papers: Computability Theory, Nonstandard Analysis, and th…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
We introduce new definitions of universal and superuniversal computable codes, which are based on a code's ability to approximate Kolmogorov complexity within the prescribed margin for all individual sequences from a given set. Such sets of…
We provide a comprehensive development of the basics of descriptive set theory for non-separable complete metric spaces whose weight is a singular cardinal $\lambda$ of countable confinality. Somewhat unexpectedly, the resulting theory is…
Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…
In his first set theory paper (1874), Cantor establishes the uncountability of $\mathbb{R}$. We study the latter in Kohlenbach's higher-order Reverse Mathematics, motivated by the observation that one cannot study concepts like `arbitrary…
The aim of this paper is to highlight a hitherto unknown computational aspect of Nonstandard Analysis pertaining to Reverse Mathematics (RM). In particular, we shall establish RM-equivalences between theorems from Nonstandard Analysis in a…
Many classically used function space structures (including the topology of pointwise convergence, the compact-open topology, the Isbell topology and the continuous convergence) are induced by a hyperspace structure counterpart. This scheme…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…
The purpose of this work is to investigate root finding problems defined on (quasi-)metric spaces, and ranging in Euclidean spaces. The motivation for this line of inquiry stems from recent models in biology and phylogenetics, where…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
Throughout the course of mathematical history, generalizations of previously understood concepts and structures have led to the fruitful development of the hierarchy of number systems, non-euclidean geometry, and many other epochal phases…
Given a sequence of subsets A_n of {0,...,n-1}, the Furstenberg correspondence principle provides a shift-invariant measure on Cantor space that encodes combinatorial information about infinitely many of the A_n's. Here it is shown that…
We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…
Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…
A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…
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…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
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…