Rodney G. Downey and Denis R. Hirschfeldt. Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, 2010, xxviii + 855 pp

Laurent Bienvenu

Rodney G. Downey and Denis R. Hirschfeldt. Algorithmic randomness and complexity. Theory and Applications of Computability. Springer, 2010, xxviii + 855 pp [Book Review]

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

Abstract	This article has no associated abstract. (fix it)
Keywords	No keywords specified (fix it)
Categories	Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic (categorize this paper)
DOI	10.1017/s1079898600000263
Options	Edit this record Mark as duplicate Export citation Find it on Scholar Request removal from index Revision history

Download options

Our Archive

Upload a copy of this paper Check publisher's policy Papers currently archived: 46,206

External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)

Through your library

Sign in / register and customize your OpenURL resolver..
Configure custom resolver

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Algorithmic Randomness and Complexity. Theory and Applications of Computability.Rodney G. Downey & Denis R. Hirschfeldt - 2012 - Bulletin of Symbolic Logic 18 (1):126-128.

Algorithmic Randomness and Measures of Complexity.George Barmpalias - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.

Computability and Randomness.André Nies - 2008 - Oxford University Press UK.

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.

The Kolmogorov Complexity of Random Reals.Liang Yu, Decheng Ding & Rodney Downey - 2004 - Annals of Pure and Applied Logic 129 (1-3):163-180.

Calibrating Randomness.Rod Downey, Denis R. Hirschfeldt, André Nies & Sebastiaan A. Terwijn - 2006 - Bulletin of Symbolic Logic 12 (3):411-491.

Coarse Reducibility and Algorithmic Randomness.Denis R. Hirschfeldt, Carl G. Jockusch, Rutger Kuyper & Paul E. Schupp - 2016 - Journal of Symbolic Logic 81 (3):1028-1046.

Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533-554.

Schnorr Randomness.Rodney G. Downey & Evan J. Griffiths - 2004 - Journal of Symbolic Logic 69 (2):533 - 554.

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.

Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.

Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, Xxxvi + 263 Pp. [REVIEW]Damir D. Dzhafarov - 2017 - Bulletin of Symbolic Logic 23 (1):113-115.

Randomness Through Computation: Some Answers, More Questions.Hector Zenil - unknown

Conference on Computability, Complexity and Randomness.Verónica Becher, C. T. Chong, Rod Downey, Noam Greenberg, Antonin Kucera, Bjørn Kjos-Hanssen, Steffen Lempp, Antonio Montalbán, Jan Reimann & Stephen Simpson - 2008 - Bulletin of Symbolic Logic 14 (4):548-549.

Analytics

Added to PP index
2013-10-27

Total views
7 ( #932,713 of 2,285,684 )

Recent downloads (6 months)
2 ( #575,397 of 2,285,684 )

How can I increase my downloads?

Downloads