Game Arguments in Computability Theory and Algorithmic Information Theory

DOI10.1007/978-3-642-30870-3_66zbMath1357.68093arXiv1204.0198OpenAlexW2964243152WikidataQ57349521 ScholiaQ57349521MaRDI QIDQ2904462

Alexander Shen

Publication date: 14 August 2012

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

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

Mathematics Subject Classification ID

Applications of game theory (91A80) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

Algorithmic minimal sufficient statistics: a new approach ⋮ Some properties of antistochastic strings ⋮ The Kolmogorov birthday paradox ⋮ Short lists with short programs in short time ⋮ Algorithmic Statistics: Normal Objects and Universal Models ⋮ On Approximate Decidability of Minimal Programs ⋮ Topological arguments for Kolmogorov complexity

This page was built for publication: Game Arguments in Computability Theory and Algorithmic Information Theory