Increasing the Gap between Descriptional Complexity and Algorithmic Probability

Adam R. Day. Increasing the Gap between Descriptional Complexity and Algorithmic Probability. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009. pages 263-273, IEEE Computer Society, 2009. [doi]

Abstract

Abstract is missing.