A Safe Approximation for Kolmogorov Complexity

DOI10.1007/978-3-319-11662-4_24zbMath1432.68198OpenAlexW31231482WikidataQ54839671 ScholiaQ54839671MaRDI QIDQ2938743

Peter Bloem, Steven de Rooij, Luís Antunes, Francisco Mota, Pieter Adriaans

Publication date: 14 January 2015

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

Full work available at URL: https://pure.uva.nl/ws/files/2408097/155469_SafeApproximation.CR.pdf

Mathematics Subject Classification ID

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

Related Items (2)

Cutting corners ⋮ Two Problems for Sophistication

This page was built for publication: A Safe Approximation for Kolmogorov Complexity