3 papers
math.LO2026
Punctually Standard and Nonstandard Models of Natural Numbers
Nikolay Bazhenov, Ivan Georgiev, Dariusz KalociÅski +2
Abstract models of computation often treat the successor function on as a primitive operation, even though its low-level implementations correspond to non-trivial…
cs.LG2025
Computable universal online learning
Dariusz KalociÅski, Tomasz Steifer
Understanding when learning is possible is a fundamental task in the theory of machine learning. However, many characterizations known from the literature deal with abstract learni…
math.LO2025
Online and feasible presentability: from trees to modal algebras
Nikolay Bazhenov, Dariusz KalociÅski, MichaÅ WrocÅawski
We investigate whether every computable member of a given class of structures admits a fully primitive recursive (also known as punctual) or fully P-TIME copy. A class with this pr…