On the ratio between the maximal T-complexity and the T-complexity of random strings

T. Aaron Gulliver, Ulrich Speidel. On the ratio between the maximal T-complexity and the T-complexity of random strings. In Proceedings of the International Symposium on Information Theory and its Applications, ISITA 2012, Honolulu, HI, USA, October 28-31, 2012. pages 498-500, IEEE, 2012. [doi]

Abstract

Abstract is missing.