Cristopher Moore – författare
Visar alla böcker från författaren Cristopher Moore. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
1 021 kr
Skickas inom 7-10 vardagar
This book not only discusses cellular automata (CA) as accouterment for simulation, but also the actual building of devices within cellular automata. CA are widely used tools for simulation in physics, ecology, mathematics, and other fields. But they are also digital "toy universes" worthy of study in their own right, with their own laws of physics and behavior. In studying CA for their own sake, we must look at constructive methods, that is the practice of actually building devices in a given CA that store and process in formation, replicate, and propagate themselves, and interact with other devices in complex ways. By building such machines, we learn what the CA's dynamics are capable of, and build an intuition about how to "engineer" the machine we want. We can also address fundamental questions, such as whether universal computation or even "living" things that reproduce and evolve can exist in the CA's digital world, and perhaps, how these things came to be in out own universe.
2 019 kr
Skickas inom 5-8 vardagar
Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. Addressed to a broad range of readers, the book includes substantial background material along with current research by leading computer scientists, mathematicians, and physicists. It will prepare students and researchers from all of these fields to contribute to this exciting area.
933 kr
Skickas inom 5-8 vardagar
Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. Addressed to a broad range of readers, the book includes substantial background material along with current research by leading computer scientists, mathematicians, and physicists. It will prepare students and researchers from all of these fields to contribute to this exciting area.
1 138 kr
Skickas inom 5-8 vardagar
Computational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology. But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs, phase transitions, and quantum computing are usually considered too advanced for the typical student. This book bridges these gaps by explaining the deep ideas of theoretical computer science in a clear and enjoyable fashion, making them accessible to non-computer scientists and to computer scientists who finally want to appreciate their field from a new point of view. The authors start with a lucid and playful explanation of the P vs. NP problem, explaining why it is so fundamental, and so hard to resolve. They then lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing. At every turn, they use a minimum of formalism, providing explanations that are both deep and accessible. The book is intended for graduate and undergraduate students, scientists from other areas who have long wanted to understand this subject, and experts who want to fall in love with this field all over again.