Short Lists with Short Programs in Short Time – A Short Proof

DOI10.1007/978-3-319-08019-2_42zbMath1432.68201arXiv1302.1109OpenAlexW1601197949MaRDI QIDQ5175915

Marius Zimand

Publication date: 25 February 2015

Published in: Language, Life, Limits (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (5)

Enumerations including laconic enumerators ⋮ Short lists for shortest descriptions in short time ⋮ Short lists with short programs in short time ⋮ Searching for shortest and least programs ⋮ On Approximate Decidability of Minimal Programs

This page was built for publication: Short Lists with Short Programs in Short Time – A Short Proof