Description: Please refer to the section BELOW (and NOT ABOVE) this line for the product details - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Title:Algorithmic Randomness And ComplexityISBN13:9780387955674ISBN10:0387955674Author:Downey, Rodney G. (Author), Hirschfeldt, Denis R. (Author)Description:Computability And Complexity Theory Are Two Central Areas Of Research In Theoretical Computer Science Until Recently, Most Work In These Areas Concentrated On Problems Over Discrete Structures, But There Has Been Enormous Growth Of Computability Theory And Complexity Theory Over The Real Numbers And Other Continuous Structures, Especially Incorporating Concepts Of Randomness This Book Provides A Systematic, Technical Development Of Algorithmic Randomness And Complexity It Presents Concepts And Results For Understanding Relative Randomness And Its Relation To Computational Complexity These New Results Are Important For Addressing Fundamental Problems In Computational Geometry, Modeling Of Dynamic Systems, And Classical Problems In Numerical Computations Binding:Hardcover, HardcoverPublisher:SpringerPublication Date:2010-11-05Weight:3.25 lbsDimensions:2.2'' H x 9.3'' L x 6.3'' WNumber of Pages:855Language:English
Price: 149.67 USD
Location: USA
End Time: 2024-11-23T16:08:38.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
Return policy details:
Book Title: Algorithmic Randomness And Complexity
Item Length: 9.3in
Item Width: 6.1in
Author: Denis R. Hirschfeldt, Rodney G. Downey
Publication Name: Algorithmic Randomness and Complexity
Format: Hardcover
Language: English
Publisher: Springer New York
Publication Year: 2010
Series: Theory and Applications of Computability Ser.
Type: Textbook
Item Weight: 109 Oz
Number of Pages: Xxviii, 855 Pages
