Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Barmpalias, G.: Algorithmic randomness and measures of complexity. Bull. Symb. Log. 19(3) (2013)
2. Bauwens, B.: Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs. ArXiv e-prints. Submitted, presented at Computability, Complexity and Randomness conference in July 2012 Cambridge (2013)
3. Bauwens, B., Shen, A.: Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity. J. Symb. Log. 79(2), 620–632 (2013)
4. Bennett, C.: Logical depth and physical complexity, pp 227–257. Oxford University Press, Inc., New York (1988)
5. Bienvenu, L., Gács, P., Hoyrup, M., Rojas, C., Shen, A.: Algorithmic tests and randomness with respect to a class of measures. Proceedings of the Steklov Institute of Mathematics 274(1), 34–89 (2011) doi: 10.1134/S0081543811060058
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献