Hostname: page-component-6bf8c574d5-8gtf8 Total loading time: 0 Render date: 2025-02-22T04:35:41.289Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  15 January 2014

Laurent Bienvenu
Laurent Bienvenu*
Affiliation:
LIAFA, Case 7014, 75205 Paris Cedex 13, France. [email protected].
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 18 , Issue 1 , March 2012 , pp. 126 - 128
Copyright
Copyright © Association for Symbolic Logic 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)