Topics include the limits of knowledge, paradox of complexity, Maxwell's demon, Big Bang theory, much more. 1985 edition.

    Turing Mathematician Alan Turing invented an imaginary computer known as the Turing Machine; in an age before computers, he explored the concept of what it meant to be "computable," creating the field of computability theory in the process, a foundation of present-day computer programming.The book expands Turing's original 36-page paper with additional background chapters and extensive annotations; the author elaborates on and clarifies many of Turing's statements, making the original difficult-to-read document accessible to present day programmers, computer science majors, math geeks, and others.Interwoven into the narrative are the highlights of Turing's own life: his years at Cambridge and Princeton, his secret work in cryptanalysis during World War II, his involvement in seminal computer projects, his speculations about artificial intelligence, his arrest and prosecution for the crime of "gross indecency," and his early death by apparent suicide at the age of 41.

    It is also a practical, modern introduction to scientific computing in Python, tailored for data-intensive applications. This is a book about the parts of the Python language and libraries you'll need to effectively solve a broad set of data analysis problems. This book is not an exposition on analytical methods using Python as the implementation language.Written by Wes McKinney, the main author of the pandas library, this hands-on book is packed with practical cases studies. It's ideal for analysts new to Python and for Python programmers new to scientific computing.Use the IPython interactive shell as your primary development environmentLearn basic and advanced NumPy (Numerical Python) featuresGet started with data analysis tools in the pandas libraryUse high-performance tools to load, clean, transform, merge, and reshape dataCreate scatter plots and static or interactive visualizations with matplotlibApply the pandas groupby facility to slice, dice, and summarize datasetsMeasure data by points in time, whether it's specific instances, fixed periods, or intervalsLearn how to solve problems in web analytics, social sciences, finance, and economics, through detailed examples

    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

    This book focuses on practical algorithms that have been used to solve key problems in data mining and which can be used on even the largest datasets. It begins with a discussion of the map-reduce framework, an important tool for parallelizing algorithms automatically. The authors explain the tricks of locality-sensitive hashing and stream processing algorithms for mining data that arrives too fast for exhaustive processing. The PageRank idea and related tricks for organizing the Web are covered next. Other chapters cover the problems of finding frequent itemsets and clustering. The final chapters cover two applications: recommendation systems and Web advertising, each vital in e-commerce. Written by two authorities in database and Web technologies, this book is essential reading for students and practitioners alike.

    The novel approach taken here banishes determinants to the end of the book and focuses on the central goal of linear algebra: understanding the structure of linear operators on vector spaces. The author has taken unusual care to motivate concepts and to simplify proofs. For example, the book presents - without having defined determinants - a clean proof that every linear operator on a finite-dimensional complex vector space (or an odd-dimensional real vector space) has an eigenvalue. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra. This second edition includes a new section on orthogonal projections and minimization problems. The sections on self-adjoint operators, normal operators, and the spectral theorem have been rewritten. New examples and new exercises have been added, several proofs have been simplified, and hundreds of minor improvements have been made throughout the text.

    Is it in our genes? The structure of our brains? Our genome may determine our eye color and even aspects of our personality. But our friendships, failures, and passions also shape who we are. The question is: how?Sebastian Seung, a dynamic professor at MIT, is on a quest to discover the biological basis of identity. He believes it lies in the pattern of connections between the brain’s neurons, which change slowly over time as we learn and grow. The connectome, as it’s called, is where our genetic inheritance intersects with our life experience. It’s where nature meets nurture.Seung introduces us to the dedicated researchers who are mapping the brain’s connections, neuron by neuron, synapse by synapse. It is a monumental undertaking—the scientific equivalent of climbing Mount Everest—but if they succeed, it could reveal the basis of personality, intelligence, memory, and perhaps even mental disorders. Many scientists speculate that people with anorexia, autism, and schizophrenia are "wired differently," but nobody knows for sure. The brain’s wiring has never been clearly seen.In sparklingly clear prose, Seung reveals the amazing technological advances that will soon help us map connectomes. He also examines the evidence that these maps will someday allow humans to "upload" their minds into computers, achieving a kind of immortality.Connectome is a mind-bending adventure story, told with great passion and authority. It presents a daring scientific and technological vision for at last understanding what makes us who we are. Welcome to the future of neuroscience.

    Contrary to time-honored intuition, the mind turns out to be a complex of brain functions. And contrary to the wishful thinking of some philosophers, there is no stemming the revolutionary impact that brain research will have on our understanding of how the mind works.Brain-Wise is the sequel to Patricia Smith Churchland's Neurophilosophy, the book that launched a subfield. In a clear, conversational manner, this book examines old questions about the nature of the mind within the new framework of the brain sciences. What, it asks, is the neurobiological basis of consciousness, the self, and free choice? How does the brain learn about the external world and about its own introspective world? What can neurophilosophy tell us about the basis and significance of religious and moral experiences?Drawing on results from research at the neuronal, neurochemical, system, and whole-brain levels, the book gives an up-to-date perspective on the state of neurophilosophy--what we know, what we do not know, and where things may go from here.

    In this unconventional introduction, physicist Leonard Susskind and hacker-scientist George Hrabovsky offer a first course in physics and associated math for the ardent amateur. Unlike most popular physics books—which give readers a taste of what physicists know but shy away from equations or math—Susskind and Hrabovsky actually teach the skills you need to do physics, beginning with classical mechanics, yourself. Based on Susskind's enormously popular Stanford University-based (and YouTube-featured) continuing-education course, the authors cover the minimum—the theoretical minimum of the title—that readers need to master to study more advanced topics.An alternative to the conventional go-to-college method, The Theoretical Minimum provides a tool kit for amateur scientists to learn physics at their own pace.

    He explains what the mind is, how it evolved, and how it allows us to see, think, feel, laugh, interact, enjoy the arts, and ponder the mysteries of life. And he does it with the wit that prompted Mark Ridley to write in the New York Times Book Review, "No other science writer makes me laugh so much. . . . [Pinker] deserves the superlatives that are lavished on him."  The arguments in the book are as bold as its title. Pinker rehabilitates some unfashionable ideas, such as that the mind is a computer and that human nature was shaped by natural selection, and challenges fashionable ones, such as that passionate emotions are irrational, that parents socialize their children, and that nature is good and modern society corrupting. Winner of the Los Angeles Times Book Prize A New York Times Notable Book of the Year and Publishers Weekly Best Book of 1997 Featured in Time magazine, the New York Times Magazine, The New Yorker, Nature, Science, Lingua Franca, and Science Times Front-page reviews in the Washington Post Book World, the Boston Globe Book Section, and the San Diego Union Book Review

    This book covers relevant geometric principles and how to represent objects algebraically so they can be computed and applied. Recent major developments in the theory and practice of scene reconstruction are described in detail in a unified framework. Richard Hartley and Andrew Zisserman provide comprehensive background material and explain how to apply the methods and implement the algorithms. First Edition HB (2000): 0-521-62304-9

    Building on the successful top-down approach of previous editions, this fourth edition continues with an early emphasis on application-layer paradigms and application programming interfaces, encouraging a hands-on experience with protocols and networking concepts.

    The author has a direct style. His book presents detailed and intensive explanations. Many diagrams and key examples are used to aid understanding, as well as the application of calculus to physics and engineering and economics. The text is well organized, and it covers single variable and multivariable calculus in depth. An instructor's manual and student guide are available online at http: //ocw.mit.edu/ans7870/resources/Strang/....

    These themes include mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and enhanced problem-solving skills through modeling. Its intent is to demonstrate the relevance and practicality of discrete mathematics to all students. The Fifth Edition includes a more thorough and linear presentation of logic, proof types and proof writing, and mathematical reasoning. This enhanced coverage will provide students with a solid understanding of the material as it relates to their immediate field of study and other relevant subjects. The inclusion of applications and examples to key topics has been significantly addressed to add clarity to every subject. True to the Fourth Edition, the text-specific web site supplements the subject matter in meaningful ways, offering additional material for students and instructors. Discrete math is an active subject with new discoveries made every year. The continual growth and updates to the web site reflect the active nature of the topics being discussed. The book is appropriate for a one- or two-term introductory discrete mathematics course to be taken by students in a wide variety of majors, including computer science, mathematics, and engineering. College Algebra is the only explicit prerequisite.

    This edition contains NEW tables on Properties of Ionic Liquids, Solubilities of Hydrocarbons in Sea Water, Solubility of Organic Compounds in Superheated Water, and Nutritive Value of Foods. It also updates many tables including Critical Constants, Heats of Vaporization, Aqueous Solubility of Organic Compounds, Vapor Pressure of Mercury, Scientific Abbreviations and Symbols, and Bond Dissociation Energies. The 88th Edition also presents a new Foreword written by Dr. Harold Kroto, a 1996 Nobel Laureate in Chemistry.