Searching for Applicable Versions of Computable Structures
On Measure Quantifiers in First-Order Arithmetic
Pistone Learning Languages with Decidable Hypotheses
Robust Online Algorithms for Dynamic Choosing Problems
On the degrees of constructively immune sets
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry
The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
Randomising Realizability
Restrictions of Hindman's Theorem: an overview
Complexity and Categoricity of Automatic Injection structures
A tale of optimizing the space taken by de Bruijn graphs
Formally Computing with the Non-Computable
Cohen Mapping Monotonic Restrictions in Inductive Inference
Normal Forms for Semantically Witness-Based Learners in Inductive Inference
xWalk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted
On 3SUM-hard problems in the Decision Tree Model
Monotonic Spectra and Their Generalizations
On false Heine/Borel compactness principles in proof mining
Placing Green Bridges Optimally, with a Multivariate Analysis
A Church-Turing thesis for randomness?
Probabilistic Models of k-mer Frequencies
Defining Formal Explanation in Classical Logic by Substructural Derivability
Dedekind Cuts and Long Strings of Zeros in Base Expansions
On the impact of treewidth in the computational complexity of freezing dynamics
Towards a Map for Incremental Learning in the Limit from Positive and Negative Information
On preserving the computational content of mathematical proofs: toy examples for a formalising strategy
n search of the first-order part of Ramsey's theorem for pairs
On subrecursive representability of irrational numbers: Contractors and Baire sequences
xiLearning
Languages in the Limit from Positive Information with Finitely Many Memory Changes.