^ 0_ n-complete properties of programs and Martin-Löf randomness

DOI10.1016/0020-0190(93)90194-EzbMATH Open0771.68072MaRDI QIDQ1210316FDOQ1210316

Kojiro Kobayashi

Publication date: 23 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Kolmogorov complexityrandomness

Mathematics Subject Classification ID

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

Cites Work

• A Theory of Program Size Formally Identical to Information Theory
• The definition of random sequences
• Incompleteness theorems for random reals
• Information, randomness and incompleteness. Papers on algorithmic information theory

Cited In (1)

• Kobayashi compressibility

This page was built for publication: \(\Sigma^ 0_ n\)-complete properties of programs and Martin-Löf randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1210316)