research
∙
12/03/2021
A reliable Turing machine
We consider computations of a Turing machine subjected to noise. In ever...
share
research
∙
05/10/2021
Lecture notes on descriptional complexity and randomness
A didactical survey of the foundations of Algorithmic Information Theory...
research
∙
10/20/2020
Inequalities for space-bounded Kolmogorov complexity
There is a parallelism between Shannon information theory and algorithmi...
research
∙
09/25/2018
