Algorithmic Randomness And Complexity by Rodney G. Downey, Hardcover | Indigo Chapters
Algorithmic Randomness And Complexity by Rodney G. Downey, Hardcover | Indigo Chapters

Coles

Algorithmic Randomness And Complexity by Rodney G. Downey, Hardcover | Indigo Chapters

From Rodney G. Downey

Current price: $233.95
Loading Inventory...

Size: 1 x 9.25 x 6.81

Visit retailer's website
*Product information may vary - to confirm product availability, pricing, and additional information please contact Coles
This book is concerned with the theory of computability and complexity over the real numbers. This theory was initiated by Turing, Grzegorczyk, Lacombe, Banach and Mazur and has seen rapid growth in recent years. 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." One reason for this growth is that more and more computation problems over the real numbers are being dealt with by computer scientists-in computational geometry and in the modeling of dynamical and hybrid systems. Scientists working on these questions come from such diverse fields as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics, and analysis. An essential resource for all researchers in theoretical computer science, logic, computability theory and complexity. | Algorithmic Randomness And Complexity by Rodney G. Downey, Hardcover | Indigo Chapters

More About Coles at Bramalea City Centre

Making Connections. Creating Experiences. We exist to add a little joy to our customers’ lives, each time they interact with us.

Powered by Adeptmind