3 citations · 15 across the 21 of their papers we have counts for
5 papers · 1 filter
Recursively Enumerably Representable Classes and Computable Versions of the Fundamental Theorem of Statistical Learning
David Kattermann, Lothar Sebastian Krapp
We study computable probably approximately correct (CPAC) learning, where learners are required to be computable functions. It had been previously observed that the Fundamental The…
Time-series Random Process Complexity Ranking Using a Bound on Conditional Differential Entropy
Jacob Ayers, Richard Hahnloser, Julia Ulrich +5
Conditional differential entropy provides an intuitive measure for relatively ranking time-series complexity by quantifying uncertainty in future observations given past context. H…
Decomposing the automorphism group of the surreal numbers
Elliot Kaplan, Lothar Sebastian Krapp, Michele Serra
We study the automorphism group of the field of surreal numbers. Our main structure theorem presents a decomposition of this group into a product of five significant factors. Using…
On Tameness, Measurability and the Independence Property
Lothar Sebastian Krapp, Matthieu Vermeil, Laura Wirth
In the area of Tame Geometry, different model-theoretic tameness conditions are established and their relationships are analyzed. We construct a subfield of the real numbers th…
Definable ranks
Lothar Sebastian Krapp, Salma Kuhlmann, Lasse Vogel
We introduce the notion of the definable rank of an ordered field, ordered abelian group and ordered set, respectively. We study the relation between the definable rank of an order…