I am the PI in the project "Computable structure theory and the philosophy of mathematical structuralism", funded by the grant
agreement no. 2023/49/B/HS1/03930, National Science Centre Poland. The project explores theoretical problems in computable structure theory and their philosophical underpinnings inspired by mathematical structuralism.
Output
- Kalociński D., San Mauro L. & Wrocławski M. (accepted).
Punctual presentability in certain classes of algebraic structures.
49th International Symposium on Mathematical Foundations of Computer Science.
I was the PI in the project "Algorithmic models of prediction: formal properties and philosophical implications", funded by the grant
agreement no. 2018/31/B/HS1/04018, National Science Centre Poland. The project explores theoretical problems related to prediction and learning by computable agents.
Output
- Dębowski Ł. (submitted).
Universal Densities Exist for Every Finite Reference Measure.
IEEE Transactions on Information Theory.
-
- Bazhenov N. & Kalociński D. (2023).
Degre spectra, and relative acceptability of notations.
Proceedings of 31st EACSL Annual Conference on Computer Science Logic (CSL 2023).
-
- Kalociński D. & Wrocławski M. (2022).
Generalization of Shapiro's theorem to higher arities and noninjective notations.
Archive for Mathematical Logic.
-
- Bienvenu L., Delle Rose V. & Steifer T. (2022).
Probabilistic vs Deterministic Gamblers.
Proceedings of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022).
-
- Bazhenov N., Kalociński D. & Wrocławski M. (2022).
Intrinsic Complexity of Recursive Functions on Natural Numbers with Standard Order.
Proceedings of 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022).
-
- Dębowski, Ł. & Steifer T. (2022).
Universal Coding and Prediction on Ergodic Random Points.
Bulletin of Symbolic Logic.
-
- Steifer T. (2021).
A note on the learning-theoretic characterizations of randomness and convergence.
Review of Symbolic Logic.
-
- Dębowski, Ł. (2021).
A Refutation of Finite-State Language Models through Zipf’s Law for Algorithmic Information.
Entropy.
-
- Steifer, T. (2021).
Simple betting and stochasticity.
Proceedings of Computability in Europe 2021: Connecting with Computability.
-
