Algorithmic randomness and complexity. Theory and Applications of Computability

&
Bulletin of Symbolic Logic 18 (1):126-128 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



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

External links

  • This entry has no external links. Add one.
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.
Game arguments in computability theory and algorithmic information theory.Alexander Shen - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 655--666.
Effective fractal dimensions.Jack H. Lutz - 2005 - Mathematical Logic Quarterly 51 (1):62-72.
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.
Randomness Through Computation: Some Answers, More Questions.Hector Zenil (ed.) - 2011 - World Scientific.
Image characterization and classification by physical complexity.Hector Zenil, Jean-Paul Delahaye & Cédric Gaucherel - 2012 - Complexity 17 (3):26-42.
Towards a stable definition of algorithmic randomness.Hector Zenil - unknown
Computability of the ergodic decomposition.Mathieu Hoyrup - 2013 - Annals of Pure and Applied Logic 164 (5):542-549.
Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.
Computability and Complexity: From a Programming Perspective Vol. 21.N. D. Jones - 1997 - MIT Press.
Chance versus Randomness.Antony Eagle - 2010 - Stanford Encyclopedia of Philosophy.
An algorithmic information theory challenge to intelligent design.Sean Devine - 2014 - Zygon 49 (1):42-65.
Probabilistic algorithmic randomness.Sam Buss & Mia Minnes - 2013 - Journal of Symbolic Logic 78 (2):579-601.
The Kolmogorov complexity of random reals.Liang Yu, Decheng Ding & Rodney Downey - 2004 - Annals of Pure and Applied Logic 129 (1-3):163-180.
The application of algorithmic information theory to noisy patterned strings.Sean Devine - 2006 - Complexity 12 (2):52-58.

Analytics

Added to PP
2015-02-04

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

The K -Degrees, Low for K Degrees,and Weakly Low for K Sets.Joseph S. Miller - 2009 - Notre Dame Journal of Formal Logic 50 (4):381-391.
Lowness for Kurtz randomness.Noam Greenberg & Joseph S. Miller - 2009 - Journal of Symbolic Logic 74 (2):665-678.
Choice classes.Ahmet Çevik - 2016 - Mathematical Logic Quarterly 62 (6):563-574.

View all 12 citations / Add more citations

References found in this work

No references found.

Add more references