Complexity And Randomness In Group Theory

Detailed Description

This monograph provides an overview of developments in group theory motivated by model theory by key international researchers in the field. Topics covered include: stable groups and generalizations, model theory of nonabelian free groups and of rigid solvable groups, pseudofinite groups, approximate groups, topological dynamics, groups interpreting the arithmetic. The book is intended for mathematicians and graduate students in group theory and model theory. The book follows the course of the GAGTA (Geometric and Asymptotic Group Theory with Applications) conference series. The first book, "Complexity and Randomness in Group Theory. GAGTA book 1," can be found here: http://www.degruyter.com/books/978-3-11-066491-1 .

Looking at a sequence of zeros and ones, we often feel that it is not random, that is, it is not plausible as an outcome of fair coin tossing. Why? The answer is provided by algorithmic information theory: because the sequence is compressible, that is, it has small complexity or, equivalently, can be produced by a short program. This idea, going back to Solomonoff, Kolmogorov, Chaitin, Levin, and others, is now the starting point of algorithmic information theory. The first part of this book is a textbook-style exposition of the basic notions of complexity and randomness; the second part covers some recent work done by participants of the “Kolmogorov seminar” in Moscow (started by Kolmogorov himself in the 1980s) and their colleagues. This book contains numerous exercises (embedded in the text) that will help readers to grasp the material.

New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.

An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography

“If you liked Chaos, you’ll love Complexity. Waldrop creates the most exciting intellectual adventure story of the year” (The Washington Post). In a rarified world of scientific research, a revolution has been brewing. Its activists are not anarchists, but rather Nobel Laureates in physics and economics and pony-tailed graduates, mathematicians, and computer scientists from all over the world. They have formed an iconoclastic think-tank and their radical idea is to create a new science: complexity. They want to know how a primordial soup of simple molecules managed to turn itself into the first living cell—and what the origin of life some four billion years ago can tell us about the process of technological innovation today. This book is their story—the story of how they have tried to forge what they like to call the science of the twenty-first century. “Lucidly shows physicists, biologists, computer scientists and economists swapping metaphors and reveling in the sense that epochal discoveries are just around the corner . . . [Waldrop] has a special talent for relaying the exhilaration of moments of intellectual insight.” —The New York Times Book Review “Where I enjoyed the book was when it dove into the actual question of complexity, talking about complex systems in economics, biology, genetics, computer modeling, and so on. Snippets of rare beauty here and there almost took your breath away.” —Medium “[Waldrop] provides a good grounding of what may indeed be the first flowering of a new science.” —Publishers Weekly

A top expert explains why a social and economic understanding of complex systems will help society to anticipate and confront our biggest challenges Imagine trying to understand a stained glass window by breaking it into pieces and examining it one shard at a time. While you could probably learn a lot about each piece, you would have no idea about what the entire picture looks like. This is reductionism -- the idea that to understand the world we only need to study its pieces -- and it is how most social scientists approach their work. In A Crude Look at the Whole, social scientist and economist John H. Miller shows why we need to start looking at whole pictures. For one thing, whether we are talking about stock markets, computer networks, or biological organisms, individual parts only make sense when we remember that they are part of larger wholes. And perhaps more importantly, those wholes can take on behaviors that are strikingly different from that of their pieces. Miller, a leading expert in the computational study of complex adaptive systems, reveals astounding global patterns linking the organization of otherwise radically different structures: It might seem crude, but a beehive's temperature control system can help predict market fluctuations and a mammal's heartbeat can help us understand the "heartbeat" of a city and adapt urban planning accordingly. From enduring racial segregation to sudden stock market disasters, once we start drawing links between complex systems, we can start solving what otherwise might be totally intractable problems. Thanks to this revolutionary perspective, we can finally transcend the limits of reductionism and discover crucial new ideas. Scientifically founded and beautifully written, A Crude Look at the Whole is a powerful exploration of the challenges that we face as a society. As it reveals, taking the crude look might be the only way to truly see.

This book gives a nice overview of the diversity of current trends in computational and statistical group theory. It presents the latest research and a number of specific topics, such as growth, black box groups, measures on groups, product replacement algorithms, quantum automata, and more. It includes contributions by speakers at AMS Special Sessions at The University of Nevada (Las Vegas) and the Stevens Institute of Technology (Hoboken, NJ). It is suitable for graduate students and research mathematicians interested in group theory.

In Complexity and Postmodernism, Paul Cilliers explores the idea of complexity in the light of contemporary perspectives from philosophy and science. Cilliers offers us a unique approach to understanding complexity and computational theory by integrating postmodern theory (like that of Derrida and Lyotard) into his discussion. Complexity and Postmodernism is an exciting and an original book that should be read by anyone interested in gaining a fresh understanding of complexity, postmodernism and connectionism.