Turing And The Universal Machine

The history of the computer is entwined with that of the modern world and most famously with the life of one man, Alan Turing. How did this device, which first appeared a mere 50 years ago, come to structure and dominate our lives so totally? An enlightening mini-biography of a brilliant but troubled man.

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.

This volume commemorates the work of Alan Turing, because it was Turing who not only introduced the most persuasive and influential concept of a machine model of effective computability, but who also anticipated in his work the diversity of topics brought together here. Turing's paper 'On computable numbers, with an application to the Entscheindungs problem' which appeared in print in 1937, contained Turing's thesis that every 'effective' computation can be programmed on a Turing machine. Furthermore it contained the unsolvability of the halting problem and of the decision problem for first-order logic, and it presented the invention of the universal Turing machine. The publication of this idea is acknowledged as a landmark of the computer age. This volume explores the historical aspect, and the influence and applications of these ideas.

The computer unlike other inventions is universal; you can use a computer for many tasks: writing, composing music, designing buildings, creating movies, inhabiting virtual worlds, communicating... This popular science history isn't just about technology but introduces the pioneers: Babbage, Turing, Apple's Wozniak and Jobs, Bill Gates, Tim Berners-Lee, Mark Zuckerberg. This story is about people and the changes computers have caused. In the future ubiquitous computing, AI, quantum and molecular computing could even make us immortal. The computer has been a radical invention. In less than a single human life computers are transforming economies and societies like no human invention before.

This book constitutes the refereed proceedings of the 5th International Conference on Machines, Computations, and Universality, MCU 2007, held in Orleans, France, September 2007. The 18 revised full papers presented together with nine invited papers cover Turing machines, register machines, word processing, cellular automata, tiling of the plane, neural networks, molecular computations, BSS machines, infinite cellular automata, real machines, and quantum computing.

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.

Alan Turning is widely known as the cryptographer extraordinaire of Bletchly Park, the man who broke the Nazi Enigma code. He has also been described as the father of the modern computer, dreaming of a machine that could think adn inaugurating a scientific revolution that we are deep in the midst of today. His work entailed too a challenge to the science of ourselves, exploring the limits between the human and technological.

"On Computable Numbers, with an Application to the Entscheidungsproblema, Alan Turinga (TM)s paper of 1937, contained his thesis that every effective computation can be programmed on such an automation as that called Turing machine. Furthermore it proved the unsolvability of the halting problem and of the decision problem for first order logic, and it presented the invention of the universal Turing machine. It is that publication that will presumably be acknowledged as marking sub specie aeternitatis the beginning of the "computer agea . This volume recognizes the still continuing influence of the Turing machine concept by collecting contributions from international specialists in logic, computability, mathematics, biology, physics, linguistics, and cognitive science, thus signalling the exceptionally wide scope of that concept.