Most works considering Alan Turing are focused on his life, his tenure at Bletchley Park and code-breaking German encrypted messages during the Second World War. Chris Bernhardt departs from this body of work in Turing's Vision in that his work does not provide a historical analysis but instead focuses on the content and underlying mathematical concepts of Turing's first major paper, ‘On computable numbers, with an application to the Entscheidungsproblem’ (hereinafter ‘On computable numbers’). While this paper is often categorized as extremely complex and abstract, it does provide the foundational work needed for Turing's endeavours later in life and arguably marks the beginning of computer science. It is this paper which Bernhardt describes in Turing's Vision.
By explaining mathematical concepts required to understand the thesis and findings of ‘On computable numbers’ through a variety of figures and approaches along with a peppering of historical context, Bernhardt makes the paper digestible for any reader with a basic understanding of computational theory. Because of the importance of ‘On computable numbers’ within the computing field and the approachability of the paper achieved in Bernhardt's work, it is clear that Turing's Vision should be a required text in any introductory course within the fields of discrete mathematics, computational theory or computer engineering. For historians of science and technology, Bernhardt's work provides the necessary detail needed to fully understand Turing's contribution to the field through his paper and the Turing machine as a concept, which supplements both B. Jack Copeland's Turing: Pioneer of the Information Age (2014) and George Dyson's Turing's Cathedral (2012), neither of which provides such a complete and self-contained tutorial of the relevant computational theory as Bernhardt's work does. Further, Bernhardt is cognizant of the complexities and abstract nature of the subject matter and interjects encouragement to the reader to devote particular attention to those concepts which are absolutely key to understanding Turing's approach using an engaging university-lecture format which at moments feels lively.
Chapter 1 lays out the foundational overview of what is defined as an Entscheidungsproblem: algorithms which result in a response of true or false, as defined by David Hilbert, and its relevance to ‘On computable numbers’, which includes defining what is computable and disproving Hilbert's view of computation. Chapter 2 focuses on Turing's goal in writing ‘On computable numbers’, which was to prove that some problems were not decidable by a computer or Turing machine through defining the concept of decidable and undecidable. Chapter 3 provides an overview of finite automata, which is required for understanding the definition of a Turing machine. Chapter 4 further provides an overview of two concepts key to the understanding of ‘On computable numbers’: the Church–Turing thesis, which defines what can be implemented with a Turing machine (i.e. algorithms), and the concept of halting. An overview of the equivalence between λ calculus, tag systems, cellular automata and Turing machines is provided in Chapter 5. Chapter 6 then shifts to how Turing machines can be defined through encodings of finite sequences of digits, where encoding is commonly thought of today as the process of compiling programs written in C++ or Java into a format readable by a computer (i.e. machine language). Further, universal Turing machines, which are capable of receiving an input program and following the instructions of that program, are explained along with their importance to ‘On computable numbers’.
Having equipped the reader with the required foundational concepts, Chapter 7 provides an overview of proofs of contradiction, a strategy used in Turing's ‘On computable numbers’, through several illustrative examples, and posits that Turing selected proofs appearing in his paper which would be ‘immediately comprehensible to mathematicians’ as opposed to problems which applied to a ‘hypothetical computing device’ (p. 121). Chapter 8 provides a definition of computable numbers, which is part of the title of Turing's paper, and, with the help of the idea of Barber's paradox, walks through Turing's proof of contradiction, showing that there is no algorithm which can list all computable numbers. Lastly, Chapter 9 provides a historical overview of the subsequent development in the field of cryptology and computing inspired by ‘On computable numbers’, such as its role in John von Neumann's paper ‘First draft of a report on the EDVAC’, and Turing's more widely known work. In closing, Chapter 9 also addresses the final years of Turing's life and subsequent royal pardon in 2013.
Bernhardt's work is not only useful for contextualizing Turing's early work within the fields of engineering, computer science and mathematics, or Turing's more popular work such as breaking the Enigma code or the Turing test, but it also begs for the engagement of those in the social sciences by eloquently placing the aforementioned computational-theory concepts within their historical contexts, including brief descriptions of the controversies among mathematicians and historical events and information about Turing's own life where relevant. Although Turing's Vision is meant to be a guide through the areas of computational theory needed to understand Turing's contribution to the field, historians and social scientists of science will find this work helpful in that it provides a crash course in the relevant computational theory, while providing enough titbits of historic context to situate the work within the larger histories of mathematics and computing. Further, Bernhardt's work was published in proximity to the recent passage of Turing's law in the United Kingdom which pardons those convicted during a period when homosexuality was criminalized within the United Kingdom.
In conclusion, not only Turing enthusiasts will appreciate Turing's Vision, but also those wanting to become acquainted with the fields of computational theory and the history of computer science due its clear and concise style. Further, the presentation of several tangential controversies within these fields calls for more attention from scholars within the fields of history and philosophy of science and technology.
