Dariusz Kalociński

Project

- 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*.