Switch to: Citations

References in:

Randomness by design

Noûs 25 (1):75-106 (1991)

Add references

You must login to add references.
  1. (1 other version)On the Concept of a Random Sequence.Alonzo Church - 1940 - Journal of Symbolic Logic 5 (2):71-72.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
    Download  
     
    Export citation  
     
    Bookmark   223 citations  
  • Uniform probability.William Dembski - manuscript
    This paper develops a general theory of uniform probability for compact metric spaces. Special cases of uniform probability include Lebesgue measure, the volume element on a Riemannian manifold, Haar measure, and various fractal measures (all suitably normalized). This paper first appeared fall of 1990 in the Journal of Theoretical Probability, vol. 3, no. 4, pp. 611—626. The key words by which this article was indexed were: ε-capacity, weak convergence, uniform probability, Hausdorff dimension, and capacity dimension.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Algorithmic information theory.Michiel van Lambalgen - 1989 - Journal of Symbolic Logic 54 (4):1389-1400.
    We present a critical discussion of the claim (most forcefully propounded by Chaitin) that algorithmic information theory sheds new light on Godel's first incompleteness theorem.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)On the Concept of a Random Sequence.Alonzo Church - 1940 - Bulletin of the American Mathematical Society 46 (2):130--135.
    Download  
     
    Export citation  
     
    Bookmark   45 citations