1 citations · 2 across the 4 of their papers we have counts for
4 papers
The axiomatic power of Kolmogorov complexity
Laurent Bienvenu, Andrei Romashchenko, Alexander Shen +2
The famous Gödel incompleteness theorem states that for every consistent sufficiently rich formal theory T there exist true statements that are unprovable in T. Such statements wo…
On the Non-robustness of Essentially Conditional Information Inequalities
Tarik Kaced, Andrei Romashchenko
We show that two essentially conditional linear inequalities for Shannon's entropies (including the Zhang-Yeung'97 conditional inequality) do not hold for asymptotically entropic p…
Effective closed subshifts in 1D can be implemented in 2D
Bruno Durand, Andrei Romashchenko, Alexander Shen
In this paper we use fixed point tilings to answer a question posed by Michael Hochman and show that every one-dimensional effectively closed subshift can be implemented by a local…
Fixed point theorem and aperiodic tilings
Bruno Durand, Andrei Romashchenko, Alexander Shen
We propose a new simple construction of an aperiodic tile set based on self-referential (fixed point) argument. People often say about some discovery that it appeared "ahead of tim…