Turing And The Universal Machine Icon Science

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.

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.

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.

The story of the jet engine has everything: genius, tragedy, heroism, a world war, the individual vs. the state, and an idea that would change the world. Frank Whittle always maintained that he was held back by a lack of government support. At the very moment in 1943 when his invention was unveiled to the world, his company, Power Jets, was forcibly nationalised. Yet Whittle's brilliance, charm and charisma helped him recruit major support from the British government and the RAF, who gave him the green light to build a jet engine at a time when to do so made little sense. Here is a story of what pushing technology to its limits can achieve - and the effect that such achievement can have on those involved.

An accessible and fascinating exploration of how Alan Turing’s mathematical theory gave rise to modern computer science and applications—from the desktop to cell phones 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 non-specialist. 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.

Having escaped domestic servitude in Germany by teaching herself to sing, and established a career in England, Caroline Herschel learned astronomy while helping her brother William, then Astronomer Royal. Soon making scientific discoveries in her own right, she swept to international scientific and popular fame. She was awarded a salary by George III in 1787 – the first woman in Britain to make her living from science. But, as a woman in a male-dominated world, Herschel's great success was achieved despite constant frustration of her ambitions. Drawing on original sources – including Herschel's diaries and her fiery letters – Claire Brock tells the story of a woman determined to win independence and satisfy her astronomical ambition.

Programming Legend Charles Petzold unlocks the secrets of the extraordinary and prescient 1936 paper by Alan M. 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.

This work investigates the precise effects on society of the new and much vaunted electronic technologies (ICTs). Are fundamental shifts already taking place in the way in which we behave, organize, and interact as a direct result of their implementation? Providing a comprehensive set of detailed empirical studies of the genesis and use of these new technologies, the book also presents some surprising counterintuitive results.