Cover; Table of Contents; Acknowledgement; Preface; Second Preface; Third Preface; List of Plates; Introduction; Index of Terminology; The Review of the Literature; The History of Algorithmic Information Theory; The Sub-Maximal Measure of Kolmogorov Complexity; Binary, Ternary, Quaternary Systems; Monochromatic and Chromatic Symbols; Aspects to Data Compression; Conclusion; Summary; Notes; Appendix A; Appendix B; Appendix C; Appendix D; Appendix E; Appendix F; Appendix G; Bibliography; Index; A; B; C; D; G; H; K; L; M; N; P; Q; R; S; T; V; W; About the Author
Summary
The research presented in Aspects of Kolmogorov Complexity addresses the fundamental standard of defining randomness as measured by a Martin-Lof level of randomness as found in random sequential binary strings
