Author: S. Barry Cooper
Release Date: 2013-03-18
In this 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAP, readers will find many of the most significant contributions from the four-volume set of the Collected Works of A. M. Turing. These contributions, together with commentaries from current experts in a wide spectrum of fields and backgrounds, provide insight on the significance and contemporary impact of Alan Turing's work. Offering a more modern perspective than anything currently available, Alan Turing: His Work and Impact gives wide coverage of the many ways in which Turing's scientific endeavors have impacted current research and understanding of the world. His pivotal writings on subjects including computing, artificial intelligence, cryptography, morphogenesis, and more display continued relevance and insight into today's scientific and technological landscape. This collection provides a great service to researchers, but is also an approachable entry point for readers with limited training in the science, but an urge to learn more about the details of Turing's work. 2013 winner of the prestigious R.R. Hawkins Award from the Association of American Publishers, as well as the 2013 PROSE Awards for Mathematics and Best in Physical Sciences & Mathematics, also from the AAP Named a 2013 Notable Computer Book in Computing Milieux by Computing Reviews Affordable, key collection of the most significant papers by A.M. Turing Commentary explaining the significance of each seminal paper by preeminent leaders in the field Additional resources available online
Author: Alan Mathison Turing
Publisher: Oxford University Press
Release Date: 2004-09-09
Lectures, scientific papers, top secret wartime material, correspondence, and broadcasts are introduced and set in context by Jack Copeland, Director of the Turing Archive for the History of Computing."--Jacket.
Author: Chris Bernhardt
Publisher: MIT Press
Release Date: 2016-05-13
Genre: Biography & Autobiography
In 1936, when he was just twenty-four years old, Alan Turing wrote a remarkable paper in which he outlined the theory of computation, laying out the ideas that underlie all modern computers. This groundbreaking and powerful theory now forms the basis of computer science. In Turing's Vision, Chris Bernhardt explains the theory, Turing's most important contribution, for the general reader. Bernhardt argues that the strength of Turing's theory is its simplicity, and that, explained in a straightforward manner, it is eminently understandable by the nonspecialist. As Marvin Minsky writes, "The sheer simplicity of the theory's foundation and extraordinary short path from this foundation to its logical and surprising conclusions give the theory a mathematical beauty that alone guarantees it a permanent place in computer theory." Bernhardt begins with the foundation and systematically builds to the surprising conclusions. He also views Turing's theory in the context of mathematical history, other views of computation (including those of Alonzo Church), Turing's later work, and the birth of the modern computer. In the paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," Turing thinks carefully about how humans perform computation, breaking it down into a sequence of steps, and then constructs theoretical machines capable of performing each step. Turing wanted to show that there were problems that were beyond any computer's ability to solve; in particular, he wanted to find a decision problem that he could prove was undecidable. To explain Turing's ideas, Bernhardt examines three well-known decision problems to explore the concept of undecidability; investigates theoretical computing machines, including Turing machines; explains universal machines; and proves that certain problems are undecidable, including Turing's problem concerning computable numbers.
Author: George Dyson
Publisher: Penguin UK
Release Date: 2012-03-01
How did computers take over the world? In late 1945, a small group of brilliant engineers and mathematicians gathered at the newly created Institute for Advanced Study in Princeton, New Jersey. Their ostensible goal was to build a computer which would be instrumental in the US government's race to create a hydrogen bomb. The mathematicians themselves, however, saw their project as the realization of Alan Turing's theoretical 'universal machine.' In Turing's Cathedral, George Dyson vividly re-creates the intense experimentation, incredible mathematical insight and pure creative genius that led to the dawn of the digital universe, uncovering a wealth of new material to bring a human story of extraordinary men and women and their ideas to life. From the lowliest iPhone app to Google's sprawling metazoan codes, we now live in a world of self-replicating numbers and self-reproducing machines whose origins go back to a 5-kilobyte matrix that still holds clues as to what may lie ahead.
This volume presents an historical and philosophical revisiting of the foundational character of Turing’s conceptual contributions and assesses the impact of the work of Alan Turing on the history and philosophy of science. Written by experts from a variety of disciplines, the book draws out the continuing significance of Turing’s work. The centennial of Turing’s birth in 2012 led to the highly celebrated “Alan Turing Year”, which stimulated a world-wide cooperative, interdisciplinary revisiting of his life and work. Turing is widely regarded as one of the most important scientists of the twentieth century: He is the father of artificial intelligence, resolver of Hilbert’s famous Entscheidungsproblem, and a code breaker who helped solve the Enigma code. His work revolutionized the very architecture of science by way of the results he obtained in logic, probability and recursion theory, morphogenesis, the foundations of cognitive psychology, mathematics, and cryptography. Many of Turing’s breakthroughs were stimulated by his deep reflections on fundamental philosophical issues. Hence it is fitting that there be a volume dedicated to the philosophical impact of his work. One important strand of Turing’s work is his analysis of the concept of computability, which has unquestionably come to play a central conceptual role in nearly every branch of knowledge and engineering.
Author: Josh Pang
Publisher: Josh Pang
My thesis explores the idea that Buckminster Fuller’s World Game is really a formal calculus capable of representing world-scale sustainability problem-solving according to the fundamental principles of a (blockchain) database + (Fuller projection) map + (machine learning) simulation in the form of a game. These computational media comprise an operational formalism which embraces all effective procedures for world-scale problem-solving. If this hypothesis is true, then that would mean World Game’s comprehensive use of the aforementioned fundamental principles are necessary for a sustainable Earth-scale civilization. Furthermore, the protocol for solution formation in the form of World Game “game” is sufficient for solving the problem of “making the world work for 100% of humanity in the shortest possible time through spontaneous cooperation without ecological offense or the disadvantage of anyone” — the objective of World Game. If this hypothesis of sufficiency is true, that means World Game’s principles are in effect synonymous with the process of making the world work. In plain English, a problem-solving engine like World Game is necessary for the survival of humanity, period.
Author: Paul J. Nahin
Publisher: Springer Science & Business Media
Release Date: 2014-04-09
Can a computer have a soul? Are religion and science mutually exclusive? Is there really such a thing as free will? If you could time travel to visit Jesus, would you (and should you)? For hundreds of years, philosophers, scientists and science fiction writers have pondered these questions and many more. In Holy Sci-Fi!, popular writer Paul Nahin explores the fertile and sometimes uneasy relationship between science fiction and religion. With a scope spanning the history of religion, philosophy and literature, Nahin follows religious themes in science fiction from Feynman to Foucault and from Asimov to Aristotle. An intriguing journey through popular and well-loved books and stories, Holy Sci-Fi! shows how sci-fi has informed humanity's attitudes towards our faiths, our future and ourselves.
This book presents a proof of universal computation in the Game of Life cellular automaton by using a Turing machine construction. It provides an introduction including background information and an extended review of the literature for Turing Machines, Counter Machines and the relevant patterns in Conway's Game of Life so that the subject matter is accessibly to non specialists. The book contains a description of the author’s Turing machine in Conway’s Game of Life including an unlimited storage tape provided by growing stack structures and it also presents a fast universal Turing machine designed to allow the working to be demonstrated in a convenient period of time.
Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more.
Author: Neil D. Jones
Publisher: Academic Press
Release Date: 2014-06-20
Computability Theory: An Introduction provides information pertinent to the major concepts, constructions, and theorems of the elementary theory of computability of recursive functions. This book provides mathematical evidence for the validity of the Church–Turing thesis. Organized into six chapters, this book begins with an overview of the concept of effective process so that a clear understanding of the effective computability of partial and total functions is obtained. This text then introduces a formal development of the equivalence of Turing machine computability, enumerability, and decidability with other formulations. Other chapters consider the formulas of the predicate calculus, systems of recursion equations, and Post's production systems. This book discusses as well the fundamental properties of the partial recursive functions and the recursively enumerable sets. The final chapter deals with different formulations of the basic ideas of computability that are equivalent to Turing-computability. This book is a valuable resource for undergraduate or graduate students.
Author: Andrew W. Appel
Publisher: Princeton University Press
Release Date: 2014-11-16
Between inventing the concept of a universal computer in 1936 and breaking the German Enigma code during World War II, Alan Turing (1912-1954), the British founder of computer science and artificial intelligence, came to Princeton University to study mathematical logic. Some of the greatest logicians in the world--including Alonzo Church, Kurt Gödel, John von Neumann, and Stephen Kleene--were at Princeton in the 1930s, and they were working on ideas that would lay the groundwork for what would become known as computer science. This book presents a facsimile of the original typescript of Turing's fascinating and influential 1938 Princeton PhD thesis, one of the key documents in the history of mathematics and computer science. The book also features essays by Andrew Appel and Solomon Feferman that explain the still-unfolding significance of the ideas Turing developed at Princeton. A work of philosophy as well as mathematics, Turing's thesis envisions a practical goal--a logical system to formalize mathematical proofs so they can be checked mechanically. If every step of a theorem could be verified mechanically, the burden on intuition would be limited to the axioms. Turing's point, as Appel writes, is that "mathematical reasoning can be done, and should be done, in mechanizable formal logic." Turing's vision of "constructive systems of logic for practical use" has become reality: in the twenty-first century, automated "formal methods" are now routine. Presented here in its original form, this fascinating thesis is one of the key documents in the history of mathematics and computer science.
Author: George S. Boolos
Publisher: Cambridge University Press
Release Date: 2007-09-17
Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, such as Godel's incompleteness theorems, but also a large number of optional topics, from Turing's theory of computability to Ramsey's theorem. This 2007 fifth edition has been thoroughly revised by John Burgess. Including a selection of exercises, adjusted for this edition, at the end of each chapter, it offers a simpler treatment of the representability of recursive functions, a traditional stumbling block for students on the way to the Godel incompleteness theorems. This updated edition is also accompanied by a website as well as an instructor's manual.