Wyniki wyszukiwania:

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...

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.