LEADER 02813nam  2200625   450 
001 9910789139703321
005 20231206230848.0
010   $a1-00-333727-9
010   $a1-000-79715-5
010   $a1-003-33727-9
010   $a1-000-79399-0
010   $a87-92982-04-2
035   $a(CKB)3710000000082885
035   $a(EBL)3400110
035   $a(SSID)ssj0001152920
035   $a(PQKBManifestationID)11683825
035   $a(PQKBTitleCode)TC0001152920
035   $a(PQKBWorkID)11149447
035   $a(PQKB)10114844
035   $a(Au-PeEL)EBL3400110
035   $a(CaPaEBR)ebr10822778
035   $a(OCoLC)904544098
035   $a(Au-PeEL)EBL7099469
035   $a(MiAaPQ)EBC3400110
035   $a(MiAaPQ)EBC7099469
035   $a(EXLCZ)993710000000082885
100   $a20230223d2009      uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aAspects of Kolmogorov complexity $ethe physics of information /$fBradley S. Tice
210  1$aGistrup, Denmark :$cRiver Publishers,$d[2009]
210  4$dİ2009
215   $a1 online resource (174 p.)
225 1 $aRiver Publishers series in information science and technology ;$vvolume 4
300   $aDescription based upon print version of record.
311   $a87-92329-26-8 
320   $aIncludes bibliographical references and index.
327   $a""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""
327   $a""Index""""A""; ""B""; ""C""; ""D""; ""G""; ""H""; ""K""; ""L""; ""M""; ""N""; ""P""; ""Q""; ""R""; ""S""; ""T""; ""V""; ""W""; ""About the Author""
330   $aThe 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.
410  0$aRiver Publishers series of information science and technology ;$vv. 4.
606   $aKolmogorov complexity
615  0$aKolmogorov complexity.
676   $a510
700   $aTice$b Bradley S.$01086081
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910789139703321
996   $aAspects of Kolmogorov complexity$93848761
997   $aUNINA