• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Algorithmic Randomness and Complexity

Algorithmic Randomness and Complexity

Paperback

Series: Theory and Applications of Computability, Book 0

General ComputersGeneral MathematicsProgramming

ISBN10: 1493938207
ISBN13: 9781493938209
Publisher: Springer
Published: Aug 23 2016
Pages: 855
Weight: 2.67
Height: 1.75 Width: 6.14 Depth: 9.21
Language: English

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.

Also from

Downey, Rodney G.

Also in

General Computers