Image from Amazon.com
Algorithmic randomness and complexity
Material type:
TextSeries: Theory and applications of computabilityPublication details: New York : Springer, ©2010.Description: xxviii, 855 p. : ill. ; 24 cmISBN: - 9780387955674
- 511.3 22 DOW-A
- QA267.7 .D67 2010
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|---|
Books
|
IIITD Reference | Mathematics | REF 511.3 DOW-A (Browse shelf(Opens below)) | Available | 004396 |
Total holds: 0
Browsing IIITD shelves, Shelving location: Reference, Collection: Mathematics Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| REF 511.3 CUN-L A logical introduction to proof | REF 511.3 CUR-F Foundations of mathematical logic | REF 511.3 DAL-L Logic and structure | REF 511.3 DOW-A Algorithmic randomness and complexity | REF 511.3 DOW-P Parameterized complexity | REF 511.3 EBB-M Mathematical logic | REF 511.3 END-M A mathematical introduction to logic |
Includes bibliographical references (p. 767-795) and index.
There are no comments on this title.