Greetings, my name is Tomasz Steifer.
Photo by Janek Steifer

About me

My affiliation is with the Institute of Fundamental Technological Research of Polish Academy of Sciences, where I am a member of the Laboratory of Professional Electronics.

I have recently completed my doctoral thesis Computable prediction of infinite binary sequences with zero-one loss, written under the supervision of Łukasz Dębowski and Dariusz Kalociński, and defended with distinction at the Institute of Computer Science. I am also a co-investigator at the Polish National Science Center grant Algorithmic models of prediction: formal properties and philosophical implications managed by Dariusz Kalociński.

As of late, my attention orbits around computablity theory and foundations of probability, esp. algorithmic randomness theory. I am also continuously interested in things such as signal processing, machine learning, mathematical logic and information theory. I have a strong affinity for mathematical philosophy and I like to think that some of my research is a part of it.

Selected papers

Fixed wagers and stochasticity. under review, 2020.

Universal Coding and Prediction on Martin-Löf Random Points. arXiv preprint arXiv:2005.03627, 2020.

Computable prediction of infinite binary sequences with zero-one loss. Institute of Computer Science, Polish Academy of Sciences, 2020.

An Almost Perfectly Predictable Process with No Optimal Predictor. 2019 IEEE International Symposium on Information Theory (ISIT), 2504-2508, 2019.

On unstable and unoptimal prediction. Mathematical Logic Quarterly 65 (2), 218-227, 2019.

Ultrasound tissue characterization based on the Lempel–Ziv complexity with application to breast lesion classification. Biomedical Signal Processing and Control 51, 235-242, 2019.

Doppler-based blood pressure measurement system for patients supported by a continuous-flow rotary left ventricular assist device. 2017 IEEE International Ultrasonics Symposium (IUS), 2017.


Information Theory and Randomness

The seminar is organized jointly by myself, Łukasz Dębowski and Dariusz Kalociński.

Typical topics include but are not limited to: algorithmic randomness, prediction, Kolmogorov complexity, randomness extraction and so on. Talks are given in Polish or English (this depends on the audience).

We usually meet online on Thursdays around 10am. If you want to participate, please contact me.