Skip to main content

Probability, Randomness and Information

  • Chapter
Probability in the Sciences

Part of the book series: Synthese Library ((SYLI,volume 201))

  • 135 Accesses

Abstract

Let us represent the successive outcomes of an experiment by a sequence of independent and identically distributed random variables on some probability space. Let us assume that these random variables will be binary valued taking the values 0 and 1. As it is well known, according to R. von Mises’ definition of randomness, the first condition for the existence of a random sequence (or Kollectiv) is that the limit of the relative frequencies of O’s and 1’s exist; the second requirement is that the limit frequence should remain invariant under place selection made by any countable set of place selection functions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Carsetti, A. (1981), “Semantica dei mondi possibili ed operatori iperintensionali”. In Atti del Convegno nazionale di Logica, edited by S. Bernini. Napoli: Bibliopolis.

    Google Scholar 

  • Carsetti, A. (1982), “Semantica denotazionale e sistemi autopoietici”. La Nuova Critica 64: 51–91.

    Google Scholar 

  • Chaitin, G. (1977), “Algorithmic entropy of sets”. Comp. and Math, with applications 2: 235–45.

    Google Scholar 

  • Chaitin, G. (1987), Algorithmic Information Theory. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Gaifman, H. and Snir, M. (1982), “Probabilities over rich languages, testing and randomness”. J. Symb. Logic 47: 495–548

    Article  Google Scholar 

  • Humphreys, P.W. (1977), “Randomness, Independence and Hypotheses”. Synthèse 36: 415–26.

    Article  Google Scholar 

  • Kolmogoroff, A.N. (1956), “Logical basis for information theory and probability”. IEEE Trans. Inf. Th. IT-14: 662–664.

    Article  Google Scholar 

  • Martin Löf, P. (1966), “The definition of random sequences”. Inf. and Control 9: 602–619.

    Article  Google Scholar 

  • Schnorr, C.P. (1971), “A unified approach to the definition of random sequences”. Math. Syst. Theory 5: 246–258.

    Article  Google Scholar 

  • Schnorr, C.P. (1974), Unpublished manuscript.

    Google Scholar 

  • Scott, D. (1982), “Domains for Denotational Semantics”. In Automata, Languages and Programming, edited by Nielsen M. and Schmidt, E.M.: Berlin: Springer.

    Google Scholar 

  • Solovay, R.M. (1975), Unpublished manuscript.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers

About this chapter

Cite this chapter

Carsetti, A. (1988). Probability, Randomness and Information. In: Agazzi, E. (eds) Probability in the Sciences. Synthese Library, vol 201. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3061-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-3061-2_12

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7877-1

  • Online ISBN: 978-94-009-3061-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics