Kolmogorov-Complexity Based on Infinite Computations

DOI10.1007/978-3-642-03456-5_4zbMath1258.68070OpenAlexW1594741024MaRDI QIDQ3644713

Günter Hotz

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_4

zbMATH Keywords

infinite computationscollectivesmonotone Kolmogorov complexity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Theories of computational complexity
• Analytic machines
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Algorithmic Information Theory
• On the Length of Programs for Computing Finite Binary Sequences
• The definition of random sequences

This page was built for publication: Kolmogorov-Complexity Based on Infinite Computations