This book has emerged from a meeting held during the week of May 29 to June 2, 1989, at St. John’s College in Santa Fe under the auspices of the Santa Fe Institute. The (approximately 40) official participants as well as equally numerous “groupies” were enticed to Santa Fe by the above “manifesto.” The book—like the “Complexity, Entropy and the Physics of Information” meeting explores not only the connections between quantum and classical physics, information and its transfer, computation, and their significance for the formulation of physical theories, but it also considers the origins and evolution of the information-processing entities, their complexity, and the manner in which they analyze their perceptions to form models of the Universe. As a result, the contributions can be divided into distinct sections only with some difficulty. Indeed, I regard this degree of overlapping as a measure of the success of the meeting. It signifies consensus about the important questions and on the anticipated answers: they presumably lie somewhere in the “border territory,” where information, physics, complexity, quantum, and computation all meet.

Briefly, we review the basic elements of computability theory and prob ability theory that are required. Finally, in order to place the subject in the appropriate historical and conceptual context we trace the main roots of Kolmogorov complexity. This way the stage is set for Chapters 2 and 3, where we introduce the notion of optimal effective descriptions of objects. The length of such a description (or the number of bits of information in it) is its Kolmogorov complexity. We treat all aspects of the elementary mathematical theory of Kolmogorov complexity. This body of knowledge may be called algo rithmic complexity theory. The theory of Martin-Lof tests for random ness of finite objects and infinite sequences is inextricably intertwined with the theory of Kolmogorov complexity and is completely treated. We also investigate the statistical properties of finite strings with high Kolmogorov complexity. Both of these topics are eminently useful in the applications part of the book. We also investigate the recursion theoretic properties of Kolmogorov complexity (relations with Godel's incompleteness result), and the Kolmogorov complexity version of infor mation theory, which we may call "algorithmic information theory" or "absolute information theory. " The treatment of algorithmic probability theory in Chapter 4 presup poses Sections 1. 6, 1. 11. 2, and Chapter 3 (at least Sections 3. 1 through 3. 4).

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 MaxEnt2008 - 28th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Engineering - encompassed all aspects of information theory, probability, statistical inference and statistical physics, including research on foundations and theoretical developments, as well as modeling techniques for several specific application areas.

Over 130 years ago, James Clerk Maxwell introduced his hypothetical "demon" as a challenge to the scope of the second law of thermodynamics. Fascination with the demon persisted throughout the development of statistical and quantum physics, information theory, and computer science, and links have been established between Maxwell's demon and each of

Modern technology has eliminated barriers posed by geographic distances between people around the globe, making the world more interdependent. However, in spite of global collaboration within research domains, fragmentation among research fields persists and even escalates. Disintegrated knowledge has become subservient to the competition in the technological and economic race, leading in the direction chosen not by reason and intellect but rather by the preferences of politics and markets. To restore the authority of knowledge in guiding humanity, we have to reconnect its scattered isolated parts and offer an evolving and diverse but shared vision of objective reality connecting the sciences and other knowledge domains and informed by and in communication with ethical and esthetic thinking and being. This collection of articles responds to the second call from the journal Philosophies to build a new, networked world of knowledge with domain specialists from different disciplines interacting and connecting with the rest of the knowledge-producing and knowledge-consuming communities in an inclusive, extended natural-philosophic, human-centric manner. In this process of reconnection, scientific and philosophical investigations enrich each other, with sciences informing philosophies about the best current knowledge of the world, both natural and human-made, while philosophies scrutinize the ontological, epistemological, and methodological foundations of sciences.

This book on complexity science comprises a collection of chapters on methods and principles from a wide variety of disciplinary fields — from physics and chemistry to biology and the social sciences.In this two-part volume, the first part is a collection of chapters introducing different aspects in a coherent fashion, and providing a common basis and the founding principles of the different complexity science approaches; the next provides deeper discussions of the different methods of use in complexity science, with interesting illustrative applications.The fundamental topics deal with self-organization, pattern formation, forecasting uncertainties, synchronization and revolutionary change, self-adapting and self-correcting systems, and complex networks. Examples are taken from biology, chemistry, engineering, epidemiology, robotics, economics, sociology, and neurology.