Bradley S. Tice – författare

This work addresses the notion of compression ratios greater than what has been known for random sequential strings in binary and larger radix-based systems as applied to those traditionally found in Kolmogorov complexity. A culmination of the author’s decade-long research that began with his discovery of a compressible random sequential string, the book maintains a theoretical-statistical level of introduction suitable for mathematical physicists. It discusses the application of ternary-, quaternary-, and quinary-based systems in statistical communication theory, computing, and physics.

This new book—the first of its kind—examines the use of algorithmic techniques to compress random and non-random sequential strings found in chains of polymers. The book is an introduction to algorithmic complexity. Examples taken from current research in the polymer sciences are used for compression of like-natured properties as found on a chain of polymers. Both theory and applied aspects of algorithmic compression are reviewed. A description of the types of polymers and their uses is followed by a chapter on various types of compression systems that can be used to compress polymer chains into manageable units. The work is intended for graduate and postgraduate university students in the physical sciences and engineering.

This new book—the first of its kind—examines the use of algorithmic techniques to compress random and non-random sequential strings found in chains of polymers. The book is an introduction to algorithmic complexity. Examples taken from current research in the polymer sciences are used for compression of like-natured properties as found on a chain of polymers. Both theory and applied aspects of algorithmic compression are reviewed. A description of the types of polymers and their uses is followed by a chapter on various types of compression systems that can be used to compress polymer chains into manageable units. The work is intended for graduate and postgraduate university students in the physical sciences and engineering.

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. A classical study of statistics that addresses both a fundamental standard of statistics as well as an applied measure for statistical communication theory. The research points to compression levels in a random state that are greater than is found in current literature. A historical overview of the field of Kolmogorov Complexity and Algorithmic Information Theory, a subfield of Information Theory, is given as well as examples using a radix 3, radix 4, and radix 5 base numbers for both random and non-random sequential strings. The text also examines monochromatic and chromatic symbols and both theoretical and applied aspects of data compression as they relate to the transmission and storage of information. The appendix contains papers on the subject given at conferences and the references are current.ContentsTechnical topics addressed in Aspects of Kolmogorov Complexity include:• Statistical Communication Theory• Algorithmic Information Theory• Kolmogorov Complexity• Martin-Lof Randomness• Compression, Transmission and Storage of Information

The monograph is a 'de-construction' of Kurt Godel's Incompleteness Theorem's paradox sentence's used to prove that no formal systems of logic or mathematics can exist. The semantic valuation of the 'meaning' behind the sentences used for the paradox is challenged and revised using other words that change the very nature of the sentences used in the paradox. These 'semantic' changes result in new meanings for the sentences used for the paradoxes and forms new interpretations of examining Godel's Incompleteness Theorem as it related to David Hilbert's unifying plan for a Formalized mathematics. The monograph includes an unpublished paper on the reason 'why' behind the writing of this monograph in the Appendix section as well as a copy of my original mathematics dissertation from which this monograph is derived that is also located in the Appendix section of this monograph. The monograph includes a chapter on 'machine intelligence' and is a culmination of my thoughts on language, machines and artificial intelligence as a whole. Technical papers on the subject are included in the Appendix section of this monograph.