Kolmogorov complexity and set theoretical representations of integers

DOI10.1002/malq.200510040zbMath1107.03043arXiv0801.0353OpenAlexW3124610789MaRDI QIDQ5485491

Serge Grigorieff, Marie C. Ferbus-Zanda

Publication date: 30 August 2006

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0801.0353

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Semantics in the theory of computing (68Q55) Turing machines and related notions (03D10)

Related Items

Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets ⋮ Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness

Cites Work

• Unnamed Item
• Unnamed Item