Time-Bounded Kolmogorov Complexity and Solovay Functions-Reference-Cited by-全球学者库

Time-Bounded Kolmogorov Complexity and Solovay Functions

Published:2012-05-17 Issue:1 Volume:52 Page:80-94
ISSN:1432-4350
Container-title:Theory of Computing Systems
language:en
Short-container-title:Theory Comput Syst

Author:

Hölzl Rupert,Kräling Thorsten,Merkle Wolfgang

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00224-012-9413-4.pdf

Reference16 articles.

1. Barmpalias, G., Downey, R., Greenberg, N.: K-trivial degrees and the jump-traceability hierarchy. Proc. Am. Math. Soc. 137(6), 2099–2109 (2009)

2. Barzdin, J.: Complexity of programs to determine whether natural numbers not greater than n belong to a recursively enumerable set. Sov. Math. Dokl. 9, 1251–1254 (1968)

3. A Half-Century Survey;C.H. Bennett,1995

4. Bienvenu, L., Downey, R.: Kolmogorov complexity and Solovay functions. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 147–158 (2009)

5. Cholak, P., Downey, R., Greenberg, N.: Strong jump-traceability I: the computably enumerable case. Adv. Math. 217(5), 2045–2074 (2008)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Searching for shortest and least programs;Theoretical Computer Science;2020-02

2. CHAITIN’S Ω AS A CONTINUOUS FUNCTION;The Journal of Symbolic Logic;2019-09-09

3. Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability;International Journal of Parallel, Emergent and Distributed Systems;2018-04-06

4. Lowness and logical depth;Theoretical Computer Science;2017-11

5. Solovay functions and their applications in algorithmic randomness;Journal of Computer and System Sciences;2015-12