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.
Read More
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.
Read Less
Add this copy of Algorithmic Randomness and Complexity to cart. $103.32, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2016 by Springer.
Add this copy of Algorithmic Randomness and Complexity to cart. $150.29, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2010 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Print on demand Sewn binding. Cloth over boards. 855 p. Contains: Unspecified, Line drawings, black & white, Figures. Theory and Applications of Computability.
