Most programs stop quickly or never halt
Authors:
- Cristian S. CaludeCristian S. Calude
- Michael A. StayMSMichael A. Stay
- 1 March 2008
- journal article
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 40 (3) , 295-308
Abstract
No abstract availableKeywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Natural halting probabilities, partial randomness, and zeta functionsInformation and Computation, 2006
- The Halting Problem Is Decidable on a Set of Asymptotic Probability OneNotre Dame Journal of Formal Logic, 2006
- Computational Power of Infinite Quantum ParallelismInternational Journal of Theoretical Physics, 2005
- Is complexity a source of incompleteness?Advances in Applied Mathematics, 2005
- From Heisenberg to Gödel via ChaitinInternational Journal of Theoretical Physics, 2005
- Coins, Quantum Measurements, and Turing's BarrierQuantum Information Processing, 2002
- The maximum speed of dynamical evolutionPhysica D: Nonlinear Phenomena, 1998
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975