At the time we were hoping that our approach of writing a book which would be both accessible without mathematical sophistication and portray these exiting new fields in an authentic manner would find an audience. Now we know it did. We know from many reviews and personal letters that the book is used in a wide range of ways: researchers use it to acquaint themselves, teachers use it in college and university courses, students use it for background reading, and there is also a substantial audience of lay people who just want to know what chaos and fractals are about. Every book that is somewhat technical in nature is likely to have a number of misprints and errors in its first edition. Some of these were caught and brought to our attention by our readers. One of them, Hermann Flaschka, deserves to be thanked in particular for his suggestions and improvements. This second edition has several changes. We have taken out the two appendices from the firstedition. At the time of the first edition Yuval Fishers contribution, which we published as an appendix was probably the first complete expository account on fractal image compression. Meanwhile, Yuvals book Fractal Image Compression: Theory and Application appeared and is now the publication to refer to.

    A new organization and emphasis on problem-solving, practical applications, and design make this book a perfect update of the 5th edition

    Now with the second edition, readers will find information on key new topics such as neural networks and statistical pattern recognition, the theory of machine learning, and the theory of invariances. Also included are worked examples, comparisons between different methods, extensive graphics, expanded exercises and computer project topics.An Instructor's Manual presenting detailed solutions to all the problems in the book is available from the Wiley editorial department.

    Distinguishing agents (e.g., molecules, cells, animals, and species) from their interactions (e.g., chemical reactions, immune system responses, sexual reproduction, and evolution), Flake argues that it is the computational properties of interactions that account for much of what we think of as beautiful and interesting. From this basic thesis, Flake explores what he considers to be today's four most interesting computational topics: fractals, chaos, complex systems, and adaptation.Each of the book's parts can be read independently, enabling even the casual reader to understand and work with the basic equations and programs. Yet the parts are bound together by the theme of the computer as a laboratory and a metaphor for understanding the universe. The inspired reader will experiment further with the ideas presented to create fractal landscapes, chaotic systems, artificial life forms, genetic algorithms, and artificial neural networks.

    Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications.Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives when interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the key ideas and algorithms of reinforcement learning. Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications. The only necessary mathematical background is familiarity with elementary concepts of probability.The book is divided into three parts. Part I defines the reinforcement learning problem in terms of Markov decision processes. Part II provides basic solution methods: dynamic programming, Monte Carlo methods, and temporal-difference learning. Part III presents a unified view of the solution methods and incorporates artificial neural networks, eligibility traces, and planning; the two final chapters present case studies and consider the future of reinforcement learning.

    This hugely informative and wonderfully entertaining little book answers one hundred essential questions about existence. It unravels the knotty, clarifies the conundrums and sheds light into dark corners. From winning the lottery, placing bets at the races and escaping from bears to sports, Shakespeare, Google, game theory, drunks, divorce settlements and dodgy accounting; from chaos to infinity and everything in between, 100 Essential Things You Didn't Know You Didn't Know has all the answers!

    The authors provide precise definitions and full proofs of results, sacrificing generalities and limiting the scope of the material in order to do so. The text is organized in four parts: strategic games, extensive games with perfect information, extensive games with imperfect information, and coalitional games. It includes over 100 exercises. Solution ManualTable of Contents, Errata, and more...

    Maudlin explains special relativity using a geometrical approach, emphasizing intrinsic space-time structure rather than coordinate systems or reference frames. He gives readers enough detail about special relativity to solve concrete physical problems while presenting general relativity in a more qualitative way, with an informative discussion of the geometrization of gravity, the bending of light, and black holes. Additional topics include the Twins Paradox, the physical aspects of the Lorentz-FitzGerald contraction, the constancy of the speed of light, time travel, the direction of time, and more.Introduces nonphysicists to the philosophical foundations of space-time theoryProvides a broad historical overview, from Aristotle to EinsteinExplains special relativity geometrically, emphasizing the intrinsic structure of space-timeCovers the Twins Paradox, Galilean relativity, time travel, and moreRequires only basic algebra and no formal knowledge of physicsTim Maudlin is professor of philosophy at New York University. His books include The Metaphysics within Physics and Quantum Non-Locality and Relativity.

    Dr. Euler's Fabulous Formula shares the fascinating story of this groundbreaking formula--long regarded as the gold standard for mathematical beauty--and shows why it still lies at the heart of complex number theory. This book is the sequel to Paul Nahin's An Imaginary Tale: The Story of I [the square root of -1], which chronicled the events leading up to the discovery of one of mathematics' most elusive numbers, the square root of minus one. Unlike the earlier book, which devoted a significant amount of space to the historical development of complex numbers, Dr. Euler begins with discussions of many sophisticated applications of complex numbers in pure and applied mathematics, and to electronic technology. The topics covered span a huge range, from a never-before-told tale of an encounter between the famous mathematician G. H. Hardy and the physicist Arthur Schuster, to a discussion of the theoretical basis for single-sideband AM radio, to the design of chase-and-escape problems. The book is accessible to any reader with the equivalent of the first two years of college mathematics (calculus and differential equations), and it promises to inspire new applications for years to come. Or as Nahin writes in the book's preface: To mathematicians ten thousand years hence, Euler's formula will still be beautiful and stunning and untarnished by time.

    Pure mathematics, the area of Bourbaki's work, seems on the surface to be an abstract field of human study with no direct connection with the real world. In reality, however, it is closely intertwined with the general culture that surrounds it. Major developments in mathematics have often followed important trends in popular culture; developments in mathematics have acted as harbingers of change in the surrounding human culture. The seeds of change, the beginnings of the revolution that swept the Western world in the early decades of the twentieth century — both in mathematics and in other areas — were sown late in the previous century. This is the story both of Bourbaki and the world that created him in that time. It is the story of an elaborate intellectual joke — because Bourbaki, one of the foremost mathematicians of his day — never existed.

    Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a new and simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems.