Spara
Algorithmic Randomness and Complexity
Författare:
häftad, 2016
Engelska
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.
- Författare
- Rodney G. Downey, Denis R. Hirschfeldt
- Upplaga
- Softcover reprint of the original 1st ed. 2010
- ISBN
- 9781493938209
- Språk
- Engelska
- Vikt
- 310 gram
- Utgivningsdatum
- 2016-08-23
- Sidor
- 855
