Skip to main content
SpringerLink
Log in

Computable Measure Theory and Algorithmic Randomness

  • Chapter
  • First Online:
Handbook of Computability and Complexity in Analysis

Part of the book series: Theory and Applications of Computability ((THEOAPPLCOM))

Abstract

We provide a survey of recent results in computable measure and probability theory, from the perspectives of both computable analysis and algorithmic randomness, and discuss the relations between them.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Université de Lorraine, CNRS, Inria, LORIA, Nancy, France

    Mathieu Hoyrup

  2. Department of Mathematics, Pennsylvania State University, State College, Pennsylvania, USA

    Jason Rute

Authors
  1. Mathieu Hoyrup
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jason Rute
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mathieu Hoyrup .

Editor information

Editors and Affiliations

  1. Department of Mathematics and Applied Mathematics, University of Cape Town, Rondebosch, South Africa

    Vasco Brattka

  2. Fakultät für Informatik, Universität der Bundeswehr München, Neubiberg, Germany

    Peter Hertling

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Hoyrup, M., Rute, J. (2021). Computable Measure Theory and Algorithmic Randomness. In: Brattka, V., Hertling, P. (eds) Handbook of Computability and Complexity in Analysis. Theory and Applications of Computability. Springer, Cham. https://doi.org/10.1007/978-3-030-59234-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-59234-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-59233-2

  • Online ISBN: 978-3-030-59234-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation