scientific article
From MaRDI portal
Publication:4071156
zbMath0311.94017MaRDI QIDQ4071156
Publication date: 1974
Full work available at URL: http://mathnet.ru/eng/umn/v29/i6/p157
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Measures of information, entropy (94A17) Topological entropy (37B40)
Related Items (4)
The Kolmogorov complexity of infinite words ⋮ Computable Følner monotilings and a theorem of Brudno ⋮ On Oscillation-free ε-random Sequences ⋮ An announce of results linking Kolmogorov complexity to entropy for amenable group actions
This page was built for publication: