scientific article

zbMath1265.68082MaRDI QIDQ3143836

J.Šindelář, Pavel Boček

Publication date: 4 December 2012

Full work available at URL: http://www.kybernetika.cz/content/2002/6/729/paper.pdf

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Kolmogorov complexityprobability measureinfinite oscillation

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Unnamed Item

Cites Work

• Theories of computational complexity
• Complexity dips in random infinite binary sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Complexity oscillations in infinite binary sequences
• The definition of random sequences
• A formal theory of inductive inference. Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: