Algorithmic Randomness and Complexity (Hardcover, Edition.)

,

Exploring the theory of computability and complexity over the real numbers, this book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists working in diverse fields concerned with theoretical computer science.


R4,406

Or split into 4x interest-free payments of 25% on orders over R50
Learn more

Discovery Miles44060
Mobicred@R413pm x 12* Mobicred Info
Free Delivery
Delivery AdviceShips in 12 - 17 working days


Toggle WishListAdd to wish list
Review this Item

Product Description

Exploring the theory of computability and complexity over the real numbers, this book provides a systematic, technical development of "algorithmic randomness" and complexity for scientists working in diverse fields concerned with theoretical computer science.

Customer Reviews

No reviews or ratings yet - be the first to create one!

Product Details

General

Imprint

Springer-Verlag New York

Country of origin

United States

Series

Theory and Applications of Computability

Release date

November 2010

Availability

Expected to ship within 12 - 17 working days

First published

November 2010

Authors

,

Dimensions

235 x 155 x 46mm (L x W x T)

Format

Hardcover

Pages

855

Edition

Edition.

ISBN-13

978-0-387-95567-4

Barcode

9780387955674

Categories

LSN

0-387-95567-4



Trending On Loot