Tallenna
Algorithmic Randomness and Complexity
Kirjailija:
nidottu, 2016
englanti
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.
- Kirjailija
- Rodney G. Downey, Denis R. Hirschfeldt
- Painos
- Softcover reprint of the original 1st ed. 2010
- ISBN
- 9781493938209
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 23.8.2016
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 855
