Algorithmic Randomness and Complexity
Denis R. Hirschfeldt, Rodney G. Downey
Springer-Verlag New York Inc., 2016
129,25 €On orderDelivery: 2-3 weeks
The theory of algorithmic randomness uses tools from computability theory and algorithmic information theory to address questions such as these. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science.
- ISBN-13
- 9781493938209
- ISBN-10
- 1493938207
- Publisher
- Springer-Verlag New York Inc.
- Year
- 2016
- Publication date
- 2016-08-23
- Pages
- 855
- Dimensions
- 235x157x50
- Weight
- 1310