Skip to main content

Lowness and Triviality for Other Randomness Notions

  • Chapter
  • First Online:
Algorithmic Randomness and Complexity

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

  • 2356 Accesses

Abstract

We now turn to lowness notions for other notions of randomness. We begin with Schnorr randomness. Since there is no universal Schnorr test, it is not clear that the notions of a set A being low for Schnorr randomness (i.e.,every Schnorr random set is Schnorr random relative to A) and being low for Schnorr tests (i.e., every Schnorr test relative to A can be covered by an unrelativized Schnorr test1) should be the same. In fact, this was an open question in Ambos-Spies and Kučera [9]. As we will see, it was solved by Kjos-Hanssen, Nies, and Stephan [207].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as 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 159.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.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rodney G. Downey .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Downey, R.G., Hirschfeldt, D.R. (2010). Lowness and Triviality for Other Randomness Notions. In: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68441-3_12

Download citation

Publish with us

Policies and ethics