Martin-löf randomness in spaces of closed sets

Journal of Symbolic Logic 80 (2):359-383 (2015)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,139

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Algorithmic randomness over general spaces.Kenshi Miyabe - 2014 - Mathematical Logic Quarterly 60 (3):184-204.
Computable randomness and betting for computable probability spaces.Jason Rute - 2016 - Mathematical Logic Quarterly 62 (4-5):335-366.
Lowness and Π₂⁰ nullsets.Rod Downey, Andre Nies, Rebecca Weber & Liang Yu - 2006 - Journal of Symbolic Logic 71 (3):1044-1052.
Characterizing strong randomness via Martin-Löf randomness.Liang Yu - 2012 - Annals of Pure and Applied Logic 163 (3):214-224.
Computably enumerable sets below random sets.André Nies - 2012 - Annals of Pure and Applied Logic 163 (11):1596-1610.
Computational randomness and lowness.Sebastiaan Terwijn & Domenico Zambella - 2001 - Journal of Symbolic Logic 66 (3):1199-1205.

Analytics

Added to PP
2016-06-30

Downloads
20 (#1,042,475)

6 months
4 (#1,252,858)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Martin–Löf random generalized Poisson processes.Logan Axon - 2018 - Annals of Pure and Applied Logic 169 (4):261-276.

Add more citations

References found in this work

Calibrating randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.
Random closed sets viewed as random recursions.R. Daniel Mauldin & Alexander P. McLinden - 2009 - Archive for Mathematical Logic 48 (3-4):257-263.

Add more references