Author:
Soler-Toscano Fernando,Zenil Hector,Delahaye Jean-Paul,Gauvrit Nicolas
Publisher
Public Library of Science (PLoS)
Reference34 articles.
1. The determination of the value of Rado's noncomputable function Sigma(k) for four-state Turing machines;AH Brady;Mathematics of Computation,1983
2. Calude CS (2002) Information and Randomness. Heidelberg: Springer.
3. Most Programs Stop Quickly or Never Halt;CS Calude;Advances in Applied Mathematics,2008
4. Calude CS, Dinneen MJ, Shu C-K (2002) Computing a Glimpse of Randomness. Exper. Math. 11, 361–370.
5. On the length of programs for computing finite binary sequences: Statistical considerations;GJ Chaitin;Journal of the ACM,1969
Cited by
114 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献