Randomness and universal machines-Reference-Cited by-同舟云学术

Randomness and universal machines

Published:2006-12 Issue:6 Volume:22 Page:738-751
ISSN:0885-064X
Container-title:Journal of Complexity
language:en
Short-container-title:Journal of Complexity

Author:

Figueira Santiago,Stephan Frank,Wu Guohua

Publisher

Elsevier BV

Subject

Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics

Reference30 articles.

1. Program size complexity for possibly infinite computations;Becher;Notre Dame J. Formal Logic,2005

2. V. Becher, S. Figueira, S. Grigorieff, J.S. Miller, Randomness and halting probabilities, J. Symbolic Logic, to appear.

3. Random reals and possibly infinite computations, Part I: randomness in ∅′;Becher;J. Symbolic Logic,2005

4. Logical depth and physical complexity;Bennett,1988

5. Chaitin Ω numbers and strong reducibilities, Proceedings of the First Japan–New Zealand Workshop on Logic in Computer Science (Auckland, 1997);Calude;J. Universal Comput. Sci.,1997

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

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

2. Differences of halting probabilities;Journal of Computer and System Sciences;2017-11

3. Computing halting probabilities from other halting probabilities;Theoretical Computer Science;2017-01

4. Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega;Journal of Computer and System Sciences;2016-12

5. A Note on the Differences of Computably Enumerable Reals;Computability and Complexity;2016-12-01