Switch to: Citations

Add references

You must login to add references.
  1. Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.
    Chaitin’s incompleteness result related to random reals and the halting probability has been advertised as the ultimate and the strongest possible version of the incompleteness and undecidability theorems. It is argued that such claims are exaggerations.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Probabilities over rich languages, testing and randomness.Haim Gaifman & Marc Snir - 1982 - Journal of Symbolic Logic 47 (3):495-548.
    Download  
     
    Export citation  
     
    Bookmark   97 citations  
  • Recognizing strong random reals.Daniel Osherson - 2008 - Review of Symbolic Logic 1 (1):56-63.
    1. Characterizing randomness. Consider a physical process that, if suitably idealized, generates an indefinite sequence of independent random bits. One such process might be radioactive decay of a lump of uranium whose mass is kept at just the level needed to ensure that the probability is one-half that no alpha particle is emitted in the nth microsecond of the experiment. Let us think of the bits as drawn from {0, 1} and denote the resulting sequence by x with coordinates x0, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Making sense of randomness: Implicit encoding as a basis for judgment.Ruma Falk & Clifford Konold - 1997 - Psychological Review 104 (2):301-318.
    Download  
     
    Export citation  
     
    Bookmark   31 citations