In this book, several world experts present (one part of) the mathematical heritage of Kolmogorov. Each chapter treats one of his research themes or a subject invented as a consequence of his discoveries. The authors present his contributions, his methods, the perspectives he opened to us, and the way in which this research has evolved up to now. Coverage also includes examples of recent applications and a presentation of the modern prospects.

In 1913, Russian imperial marines stormed an Orthodox monastery at Mt. Athos, Greece, to haul off monks engaged in a dangerously heretical practice known as Name Worshipping. Exiled to remote Russian outposts, the monks and their mystical movement went underground. Ultimately, they came across Russian intellectuals who embraced Name Worshipping—and who would achieve one of the biggest mathematical breakthroughs of the twentieth century, going beyond recent French achievements. Loren Graham and Jean-Michel Kantor take us on an exciting mathematical mystery tour as they unravel a bizarre tale of political struggles, psychological crises, sexual complexities, and ethical dilemmas. At the core of this book is the contest between French and Russian mathematicians who sought new answers to one of the oldest puzzles in math: the nature of infinity. The French school chased rationalist solutions. The Russian mathematicians, notably Dmitri Egorov and Nikolai Luzin—who founded the famous Moscow School of Mathematics—were inspired by mystical insights attained during Name Worshipping. Their religious practice appears to have opened to them visions into the infinite—and led to the founding of descriptive set theory. The men and women of the leading French and Russian mathematical schools are central characters in this absorbing tale that could not be told until now. Naming Infinity is a poignant human interest story that raises provocative questions about science and religion, intuition and creativity.

"One of the themes of the book is how to have a fulfilling professional life. In order to achieve this goal, Krantz discusses keeping a vigorous scholarly program going and finding new challenges, as well as dealing with the everyday tasks of research, teaching, and administration." "In short, this is a survival manual for the professional mathematician - both in academics and in industry and government agencies. It is a sequel to the author's A Mathematician's Survival Guide."--BOOK JACKET.

INTRODUCTION TO ARNOLD’S PROOF OF THE KOLMOGOROV–ARNOLD–MOSER THEOREM This book provides an accessible step-by-step account of Arnold’s classical proof of the Kolmogorov–Arnold–Moser (KAM) Theorem. It begins with a general background of the theorem, proves the famous Liouville–Arnold theorem for integrable systems and introduces Kneser’s tori in four-dimensional phase space. It then introduces and discusses the ideas and techniques used in Arnold’s proof, before the second half of the book walks the reader through a detailed account of Arnold’s proof with all the required steps. It will be a useful guide for advanced students of mathematical physics, in addition to researchers and professionals. Features • Applies concepts and theorems from real and complex analysis (e.g., Fourier series and implicit function theorem) and topology in the framework of this key theorem from mathematical physics. • Covers all aspects of Arnold’s proof, including those often left out in more general or simplifi ed presentations. • Discusses in detail the ideas used in the proof of the KAM theorem and puts them in historical context (e.g., mapping degree from algebraic topology).

In this paper, we explore a new electron model based on Helmholtz’s electron vortex and Kolmogorov theory of turbulence. We also discuss a new model of origination of charge and matter.

This must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features. This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kučera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution. Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface. As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.

Translated from the popular French edition, this book offers a detailed introduction to various basic concepts, methods, principles, and results of commutative algebra. It takes a constructive viewpoint in commutative algebra and studies algorithmic approaches alongside several abstract classical theories. Indeed, it revisits these traditional topics with a new and simplifying manner, making the subject both accessible and innovative. The algorithmic aspects of such naturally abstract topics as Galois theory, Dedekind rings, Prüfer rings, finitely generated projective modules, dimension theory of commutative rings, and others in the current treatise, are all analysed in the spirit of the great developers of constructive algebra in the nineteenth century. This updated and revised edition contains over 350 well-arranged exercises, together with their helpful hints for solution. A basic knowledge of linear algebra, group theory, elementary number theory as well as the fundamentals of ring and module theory is required. Commutative Algebra: Constructive Methods will be useful for graduate students, and also researchers, instructors and theoretical computer scientists.

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic.

Over the past eighty years, martingales have become central in the mathematics of randomness. They appear in the general theory of stochastic processes, in the algorithmic theory of randomness, and in some branches of mathematical statistics. Yet little has been written about the history of this evolution. This book explores some of the territory that the history of the concept of martingales has transformed. The historian of martingales faces an immense task. We can find traces of martingale thinking at the very beginning of probability theory, because this theory was related to gambling, and the evolution of a gambler’s holdings as a result of following a particular strategy can always be understood as a martingale. More recently, in the second half of the twentieth century, martingales became important in the theory of stochastic processes at the very same time that stochastic processes were becoming increasingly important in probability, statistics and more generally in various applied situations. Moreover, a history of martingales, like a history of any other branch of mathematics, must go far beyond an account of mathematical ideas and techniques. It must explore the context in which the evolution of ideas took place: the broader intellectual milieux of the actors, the networks that already existed or were created by the research, even the social and political conditions that favored or hampered the circulation and adoption of certain ideas. This books presents a stroll through this history, in part a guided tour, in part a random walk. First, historical studies on the period from 1920 to 1950 are presented, when martingales emerged as a distinct mathematical concept. Then insights on the period from 1950 into the 1980s are offered, when the concept showed its value in stochastic processes, mathematical statistics, algorithmic randomness and various applications.

This vividly illustrated history of the International Congress of Mathematicians- a meeting of mathematicians from around the world held roughly every four years- acts as a visual history of the 25 congresses held between 1897 and 2006, as well as a story of changes in the culture of mathematics over the past century. Because the congress is an int