Name: Algorithmic Randomness and Complexity
Price: 1858.00 ZAR
Availability: InStock
Author: Downey, Rodney G. ; Hirschfeldt, Denis R.
ISBN: 9781493938209

Select your country

Americas

Europe

Rest of the world

portada Algorithmic Randomness and Complexity

Type

Physical Book

Author

Rodney G. Downey

Denis R. Hirschfeldt

Publisher

Springer

Language

English

Pages

855

Format

Paperback

Dimensions

23.4 x 15.6 x 4.4 cm

Weight

1.21 kg.

ISBN13

9781493938209

Synopsis "Algorithmic Randomness and Complexity"

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.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews

Algorithmic Randomness and Complexity - Downey, Rodney G. ; Hirschfeldt, Denis R.

Synopsis "Algorithmic Randomness and Complexity"

Customers reviews

Frequently Asked Questions about the Book

Is the book original?

In what language is the book written?

What is the format of this book?

Questions and Answers about the Book

Opinions about Bookdelivery