Kolmogorov Complexities and Algorithmic Randomness in Computability Theory: A Logosophistic Investigation
Usually printed in 3 - 5 business days
A philosophical examination of Kolmogorov complexity and algorithmic randomness in one of the most intriguing branches of contemporary mathematics.
Details
- Publication Date
- Nov 28, 2017
- Language
- English
- ISBN
- 9781387402311
- Category
- Reference
- Copyright
- All Rights Reserved - Standard Copyright License
- Contributors
- By (author): Daniel Deleanu
Specifications
- Pages
- 148
- Binding Type
- Paperback Perfect Bound
- Interior Color
- Black & White
- Dimensions
- US Trade (6 x 9 in / 152 x 229 mm)