Algorithmic randomness and measures of complexity

Bulletin of Symbolic Logic 19 (3):318-350 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/bsl.1903020

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,164

External links

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

Through your library

My notes

Similar books and articles

Algorithmic randomness and measures of complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
Constructive equivalence relations on computable probability measures.Laurent Bienvenu & Wolfgang Merkle - 2009 - Annals of Pure and Applied Logic 160 (3):238-254.
Image characterization and classification by physical complexity.Hector Zenil, Jean-Paul Delahaye & Cédric Gaucherel - 2012 - Complexity 17 (3):26-42.
Randomness Through Computation: Some Answers, More Questions.Hector Zenil (ed.) - 2011 - World Scientific.
Towards a stable definition of algorithmic randomness.Hector Zenil - unknown
Chance versus Randomness.Antony Eagle - 2010 - Stanford Encyclopedia of Philosophy.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
Quantum mechanics and algorithmic randomness.Ulvi Yurtsever - 2000 - Complexity 6 (1):27-34.
How much randomness is needed for statistics?Bjørn Kjos-Hanssen, Antoine Taveneaux & Neil Thapen - 2012 - In S. Barry Cooper (ed.), Annals of Pure and Applied Logic. pp. 395--404.
Algorithmic randomness and complexity. Theory and Applications of Computability.Rodney G. Downey & Denis R. Hirschfeldt - 2012 - Bulletin of Symbolic Logic 18 (1):126-128.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
Disentangling complexity from randomness and chaos.Lena Zuchowski - unknown
An algorithmic information theory challenge to intelligent design.Sean Devine - 2014 - Zygon 49 (1):42-65.
Computability and Randomness.André Nies - 2008 - Oxford, England: Oxford University Press UK.
Concepts of randomness.Peter Kirschenmann - 1972 - Journal of Philosophical Logic 1 (3/4):395 - 414.

Analytics

Added to PP
2016-06-30

Downloads
11 (#1,065,379)

6 months
2 (#1,114,623)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Kolmogorov complexity and computably enumerable sets.George Barmpalias & Angsheng Li - 2013 - Annals of Pure and Applied Logic 164 (12):1187-1200.

Add more citations

References found in this work

[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
A C.E. Real That Cannot Be SW-Computed by Any Ω Number.George Barmpalias & Andrew E. M. Lewis - 2006 - Notre Dame Journal of Formal Logic 47 (2):197-209.

View all 14 references / Add more references