Kolmogorov Complexity and Noncomputability

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200211)48:4<574::AID-MALQ574>3.0.CO;2-O" /><574::AID-MALQ574>3.0.CO;2-O 10.1002/1521-3870(200211)48:4<574::AID-MALQ574>3.0.CO;2-OzbMath1009.68062OpenAlexW1992006170MaRDI QIDQ4787876

George Davie

Publication date: 8 January 2003

Full work available at URL: https://doi.org/10.1002/1521-3870(200211)48:4<574::aid-malq574>3.0.co;2-o

zbMATH Keywords

Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursively (computably) enumerable sets and degrees (03D25) Complexity of proofs (03F20)

This page was built for publication: Kolmogorov Complexity and Noncomputability