description: abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules
173 results
by Nigel Toon · 13 Dec 2023
These describe the limitations and incomputability of formal systems. Alan Turing’s famous paper describing his ‘universal machine’, which later came to be called the ‘Turing machine’ and formed the basis for modern computers, also focusses on this issue. Turing showed that a machine applying a sequence of instructions to a set
…
Ada Lovelace’s description of software and that this helped him to develop his concept of a ‘universal machine’, or what we now call the Turing machine. Turing showed that even the most complex tasks could be broken down into a long list of simple instructions acting on data. As we added
…
Turing captured in his 1936 paper ‘On computable numbers …’,4 in which he described his theory for a ‘universal machine’ (what we now call a Turing machine), essentially described a problem that, if solved, would deliver a general-purpose computing machine. This incredibly important theory was the formulation of a problem that
…
: Bennett, C. H., ‘Logical reversibility of computation’, IBM Journal of Research and Development, 17: 6 (1973), pp. 525–32; Benioff, Paul, ‘Quantum mechanical models of Turing machines that dissipate no energy’, Physical Review Letters, 48: 1581 (1982), pp. 1581–1585; Shor, Peter W., ‘Algorithms for quantum computation: discrete logarithms and factoring’, Proceedings
by Sebastian Mallaby; · 30 Mar 2026 · 607pp · 161,998 words
. The clue to Hassabis’s meaning lay in the word “classical.” By classical, Hassabis meant not quantum. Sometimes Hassabis also referred to classical computers as “Turing machines,” and to himself as “Turing’s champion.” A classical or Turing computer, first proposed by Alan Turing in 1936, operates on bits of information, which
…
formulated it in the late 1980s and 1990s, but absurd given AI’s progress a quarter of a century later. DeepMind’s achievements demonstrated that Turing machines were far more powerful than Penrose had suspected: They could mimic intuition and spatial intelligence; they could chat and model proteins. A large part of
…
processed a near infinity of bits, attaining a scale that allowed classical computers to transcend the constraint of binary information. As Turing had foretold, a Turing machine of infinite size could discover infinite patterns, solving the problem of induction and disproving Penrose’s claims about the limits of classical computers. Where Penrose
…
found a way of building it!’ “If Manhattan is what humans have achieved with the classical computers in their heads, what does that say about Turing machines? “It says that we don’t know what the limit is. “And that has huge implications. The fullest version of this theory means that we
…
brain, and firm on the prevalence of quantum effects within the universe. “Now, of course I acknowledge that there are problems in mathematics that a Turing machine probably can’t solve, like factorizing large numbers,” Hassabis conceded, referring to the challenge of starting with a very big number and finding the two
…
large prime numbers that can be multiplied together to produce it. “For a Turing machine to solve a problem, there has to be a pattern that a model can learn. If there’s no pattern, the search becomes intractable. And
…
enough examples. And you don’t need quantum mechanics for these patterns to be discovered. “So it’s a very interesting question—what can a Turing machine actually find out? “And that’s what I’d like to find out. “I see myself as kind of like Turing’s champion, pushing
…
Turing machines to their limit.” * * * • • • I pondered Hassabis’s ambivalence about power, his indifference to riches, his quasi-spiritual desire for scientific knowledge. How did such a
…
, 207, 209 translational systems, 207, 209 Trump, Donald, xxi, 237, 370 Tsai, Joe, 248 Tunyasuvunakool, Kathryn, 429n9 Turing, Alan, 57, 84, 332, 389–94, 409n27 Turing machines, 389–94 280B project, 286 U UniProt database, 267–69 United Arab Emirates, 328 University College London, 45, 50 University of Cambridge Daugman at, 27
by Jacob Siegel · 24 Mar 2026 · 348pp · 103,246 words
.” * * * Alan Turing designed a universal computer that could solve any solvable problem. Though it existed only in his mind as an abstract thought experiment, the Turing machine named for the English mathematician became one of the most important and influential computers ever conceived. The abstract machine contained the same parts and followed
by Brian Potter · 15 Feb 2025 · 474pp · 134,246 words
, no. 19 (2020): 6258–87, https://doi.org/10.1039/D0GC02058C. 220 Alan Turing’s model of a computer that could perform any computation, the Turing machine, was based on a human calculator following a specific set of calculation steps. Jonathon Keats, “How Alan Turing Found Machine Thinking in the Human Mind
by George Dyson · 6 Mar 2012
lives of those who brought them into existence, and how code took over the world.” eISBN: 978-0-307-90706-6 1. Computers—History. 2. Turing machines. 3. Computable functions. 4. Random access memory. 5. Von Neumann, John, 1903–1957. 6. Turing, Alan Mathison, 1912–1954. I. Title. QA76.17.D97 2012
…
(1972), Nicholas Metropolis’s History of Computing in the Twentieth Century (1980), Andrew Hodges’s Alan Turing: The Enigma (1983), Rolf Herken’s The Universal Turing Machine: A Half-Century Survey (1988), and William Aspray’s John von Neumann and the Origins of Modern Computing (1990). Julian Bigelow and his colleagues designed
…
of a class of devices (including an obedient human being) that could read, write, remember, and erase marks on an unbounded supply of tape. These “Turing machines” were able to translate, in both directions, between bits embodied as structure (in space) and bits encoded as sequences (in time). Turing then demonstrated the
…
on paper tape. “Being digital should be of more interest than being electronic,” Turing pointed out.6 Von Neumann set out to build a Universal Turing Machine that would operate at electronic speeds. At its core was a 32-by-32-by-40-bit matrix of high-speed random-access memory—the
…
were demonstrations, if not the direct offspring, of his, Gödel’s, ideas. “What von Neumann perhaps had in mind appears more clearly from the universal Turing machine,” he later explained to Arthur Burks. “There it might be said that the complete description of its behavior is infinite because, in view of the
…
non existence of a decision procedure predicting its behavior, the complete description could be given only by an enumeration of all instances. The universal Turing machine, where the ratio of the two complexities is infinity, might then be considered to be a limiting case.”53 Leibniz’s belief in a universal
…
computation is the transformation of a bit between its two possible forms of existence: as structure (memory) or as sequence (code). This is what a Turing Machine does when reading a mark (or the absence of a mark) on a square of tape, changing its state of mind accordingly, and making (or
…
. You can’t rely upon chance.”72 According to Bigelow, the forty-fold parallel architecture, despite its deviations, was descended directly from the pure-serial Turing Machine. “Turing’s machine does not sound much like a modern computer today, but nevertheless it was,” Bigelow explains. “It was the germinal idea. If you
…
these operations the m-configuration may be changed.12 Turing introduced two fundamental assumptions: discreteness of time and discreteness of state of mind. To a Turing machine, time exists not as a continuum, but as a sequence of changes of state. Turing assumed a finite number of possible states at any given
…
which seriously affects computation, since the use of more complicated states of mind can be avoided by writing more symbols on the tape.”13 The Turing machine thus embodies the relationship between an array of symbols in space and a sequence of events in time. All traces of intelligence were removed. The
…
infinite, but if more tape is needed, the supply can be counted on never to run out. Each step in the relationship between tape and Turing machine is determined by an instruction table listing all possible internal states, all possible external symbols, and, for every possible combination, what to do (write or
…
erase a symbol, move right or left, change the internal state) in the event that combination comes up. The Turing machine follows instructions and never makes mistakes. Complicated behavior does not require complicated states of mind. By taking copious notes, the
…
Turing machine can function with as few as two internal states. Behavioral complexity is equivalent whether embodied in complex states of mind (m-configurations) or complex symbols (
…
,” he announced.14 The Universal Machine, when provided with a suitably encoded description of some other machine, executes this description to produce equivalent results. All Turing machines, and therefore all computable functions, can be encoded by strings of finite length. Since the number of possible machines is countable but the number of
…
be given a finite description but could not be computed by finite means. One of these was the halting function: given the number of a Turing machine and the number of an input tape, it returns either the value 0 or the value 1 depending on whether the computation will ever come
…
for seventy-six years. In March of 1937, Alonzo Church reviewed “On Computable Numbers” in the Journal of Symbolic Logic, and coined the term Turing machine. “Computability by a Turing machine,” wrote Church, “has the advantage of making the identification with effectiveness in the ordinary (not explicitly defined) sense evident immediately.”18 Church’s
…
Turing showed that undecidable statements, resistant to the assistance of an external oracle, could still be constructed, and the Entscheidungsproblem would remain unsolved. The Universal Turing Machine of 1936 gets all the attention, but Turing’s O-machines of 1939 may be closer to the way intelligence (real and artificial) works: logical
…
cryptography, where a little ingenuity in encoding a message can resist a large amount of ingenuity if the message is intercepted along the way. A Turing machine can be instructed to conceal meaningful statements in what appears to be meaningless noise—unless you know the key. A
…
Turing machine can also be instructed to search for meaningful statements, but since there will always be uncountably more meaningless statements than meaningful ones, concealment would appear
…
Newman, who had set all these wheels in motion when he sparked Turing’s original interest in the Entscheidungsproblem in 1935. Colossus was an electronic Turing machine, and if not yet universal, it had all the elements in place. Colossus was so successful (and subspecies of Fish so prolific) that by the
…
the ENIAC, and was both running and replicated while the one-of-a-kind ENIAC was still being built. Each Fish was a form of Turing machine, and the process by which the Colossi were used to break the various species of Fish demonstrated how the function (or partial function) of one
…
Turing machine could be encoded for execution by another Turing machine. Since the British did not know the constantly changing state of the Fish, they had to guess. Colossus, trained to sense
…
mathematical fit. J. R. Womersley, superintendent of the Mathematics Division of the National Physical Laboratory, who had read “On Computable Numbers” and become interested in Turing machines before the war, had been sent to the United States in the spring of 1945 to survey the latest (and still-secret) computer developments, including
…
the cost of a cerebral cortex at £300 per annum—his King’s College fellowship for the year. Viewed as part of a finite-state Turing machine, the delay line represented a continuous loop of tape, 1,000 squares in length and making 1,000 complete passes per second under the read
…
pseudomorphosis resumed its course. The von Neumann address matrix is becoming the basis of a non–von Neumann address matrix, and Turing machines are being assembled into systems that are not Turing machines. Codes—we now call them apps—are breaking free from the intolerance of the numerical address matrix and central clock cycle
…
their ability to compute. Sending an e-mail, or transferring a file, does not physically move anything; it creates a new copy somewhere else. A Turing machine is, by definition, able to make exact copies of any readable sequence—including its own state of mind and the sequence stored on its own
…
tape. A Turing machine can, therefore, make copies of itself. This caught the attention of von Neumann at the same time as the Institute for Advanced Study computer project
…
ones on it. What is needed … is an automaton whose output is other automata.”7 Using the same method of logical substitution by which a Turing machine can be instructed to interpret successively higher-level languages—or by which Gödel was able to encode metamathematical statements within ordinary arithmetic—it was possible
…
to design Turing machines whose coded instructions addressed physical components, not memory locations, and whose output could be translated into physical objects, not just zeros and ones. “Small variations
…
-reproduction is fundamentally a problem of communication, over a noisy channel, from one generation to the next. “Turing!” refers to the powers of the Universal Turing Machine, and “Not Turing!” refers to the limitations of those powers—and how they might be transcended by living and nonliving things. “Pitts-McCulloch!” refers to
…
a memory of 25 kilobytes, or 2 × 105 bits. The present scale of the digital universe has been estimated at 1022 bits. The number of Turing machines populating this universe is unknown, and increasingly these machines are virtual machines that do not necessarily map to any particular physical hardware at any particular
…
the local conditions, might be the development of the Universal Machine. Over long distances, it is expensive to transport structures, and inexpensive to transmit sequences. Turing machines, which by definition are structures that can be encoded as sequences, are already propagating themselves, locally, at the speed of light. The notion that one
…
migrate from one place to another as an electromagnetic signal, as long as there’s a digital world—a civilization that has discovered the Universal Turing Machine—for it to colonize when it gets there. And that’s why von Neumann and you other Martians got us to build all these computers
…
of the greatest significance,” but never received an answer, von Neumann having given up his correspondence by that time. “It is easy to construct a Turing machine that allows us to decide, for each formula F of the restricted functional calculus and every natural number n, whether F has a proof of
…
. 10. I. J. Good to Sara Turing, December 9, 1956, AMT; Robin Gandy, “The Confluence of Ideas in 1936,” in Rolf Herken, ed., The Universal Turing Machine: A Half-Century Survey (Oxford: Oxford University Press, 1988), p. 85. 11. Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of
…
, AMT. 17. Freeman Dyson, interview with author, May 5, 2004, GBD; Martin Davis, “Influences of Mathematical Logic on Computer Science,” in Herken, ed., The Universal Turing Machine, p. 315. 18. Alonzo Church, “Review of A.M. Turing, ‘On Computable Numbers, with an Application to the Entscheidungsproblem,’ ” Journal of Symbolic Logic 2, no
…
, 8.1, 8.2 and termination of the ECP, 14.1, 18.1, 18.2 on time (vs. sequence), 16.1, 16.2 on Universal Turing Machine, 8.1, 14.1 visits Manchester (1948) on von Neumann, 5.1, 5.2, 7.1, 8.1, 8.2, 14.1, 14.2 on
…
, 8.2, 14.1 reliability of, 7.1, 7.2, 8.1, 8.2, 11.1, 12.1 speed (and asynchronous arithmetic) of as Universal Turing Machine, 1.1, 8.1 see also ECP; Williams (memory) tubes IBM (International Business Machines), 4.1, 7.1, 7.2, 8.1, 8.2, 10
…
, 17.2 and nondeterministic machines on “oracle machines” on unorganized machines and von Neumann, 5.1, 13.1, 13.2, 13.3 see also Universal Turing Machine Turing, Ethel Sara Turing, Julius Mathison Turing, Sara, 13.1, 13.2, 13.3 Turing’s cathedral, Google as turtles Ujelang (Marshall Islands) Ulam, Adam
…
also incompleteness United States Atomic Energy Commission, see Atomic Energy Commission (AEC) UNIVAC (Universal Automatic Computer), 5.1, 18.1 Universal Constructor (von Neumann) Universal Turing Machine, prf.1, 1.1, 5.1, 6.1, 11.1, 13.1, 13.2, 13.3, 14.1, 15.1, 15.2, 17.1 and
…
.1, 8.1, 10.1, 16.1 superstitions of and theory of self-reproducing automata, 1.1, 15.1, 15.2 and Turing (and Universal Turing Machine), 1.1, 3.1, 5.1, 6.1, 8.1, 13.1, 13.2, 13.3, 13.4, 13.5, 15.1 and Stan Ulam
by Ed Finn · 10 Mar 2017 · 285pp · 86,853 words
: The Work of Algorithms 5 Counting Bitcoin Coda: The Algorithmic Imagination Works Cited Figure Credits Index List of Illustrations Figure 1.1 “This is a Turing Machine implemented in Conway’s Game of Life.” Designed by Paul Rendell. Figure 1.2 Norbert Wiener and his “moth” circa 1950. Alfred Eisenstaedt / The LIFE
…
nature of the universe must exist beyond the system itself.10 His work turns on the distinction between information and meaning, between the work a Turing Machine does in processing symbols on a tape and the impact of those symbols on the human mind. We hear echoes of Snow Crash in the
…
what counts as a problem and a solution, the anchor point here is the notion of abstraction. The argument for computationalism begins with the Universal Turing Machine, mathematician Alan Turing’s breathtaking vision of a computer that can complete any finite calculation simply by reading and writing to an infinite tape marked
…
a computational “ceiling” where any Turing computer can emulate any other: the instructions may proceed more slowly or quickly, but are mathematically equivalent. The Universal Turing Machine is a thought experiment that determines the bounds of what is computable: Turing and his fellow mathematician Alonzo Church were both struggling with the boundary
…
” (that is, given enough time and pencils, a human could do it) only if the Universal Turing Machine can do it. The thesis uses this informal definition to unite three different rigorous mathematical theses about computation (Turing machines, Church’s lambda calculus, and mathematician Kurt Gödel’s concept of recursive functions), translating their specific
…
the things that other men saw.”22 In other words, he possessed a genius for abstraction, and his greatest achievement in this regard was the Turing machine. Turing’s simple imaginary machine is an elegant mathematical proof for universal computation, but it is also an ur-algorithm, an abstraction generator. The mathematical
…
a shadow, a puddled remainder of context and specificity left behind in the act of lifting some idea to a higher plane of thought. The Turing machine leaves open the question of what “effectively computable” might really mean in material reality, where we leave elegance and infinite tapes behind. As it has
…
This desire encoded in the notion of effectiveness is typically obscured in the regime of computation, but the role of abstraction is celebrated. The Universal Turing Machine provides a conceptual platform for uniting all kinds of computing: algorithms for solving a set of problems in particle physics might suddenly be useful in
…
computational systems to the notion of universal computation. Many complex systems demonstrate computational features or appear to be computable. If complex systems are themselves computational Turing Machines, they are therefore equivalent: weather systems, human cognition, and most provocatively the universe itself.24 The grand problems of the cosmos (the origins thereof, the
…
Became Posthuman, theoretical models of biophysical reality like the early McCulloch–Pitts Neuron (which the logician Walter Pitts proved to be computationally equivalent to a Turing machine) allowed cybernetics to establish correlations between computational and biological processes at paradigmatic and operational levels and lay claim to being what informatics scholar Geoffrey Bowker
…
and others would later reach for as universal computation.34 As early as The Human Use of Human Beings, Wiener popularized these links between the Turing machine, neural networks, and learning in biological organisms, work that is now coming to startling life in the stream of machine learning breakthroughs announced by the
…
generation of information, or seemingly living or self-perpetuating patterns, from simple rule-sets. It, too, has been shown to be mathematically equivalent to a Turing machine, and indeed mathematician Paul Rendell designed a game of life that he proved to be Turing-equivalent (figure 1.1).37 Figure 1.1 “This
…
is a Turing Machine implemented in Conway’s Game of Life.” Designed by Paul Rendell. In fact, if we accept the premise of organism as message, of informational patterns
…
concerns I explore here in the context of the algorithm. Programmed Visions draws a direct link between the notion of fungible computability reified by the Turing machine and the kinds of linguistic magic that have come to define so many of our computational experiences: Software is unique in its status as metaphor
…
of magic—the manipulation of symbols in ways that impact the world. This fundamental alchemy, the mysterious fungibility of sourcery, reinforces a reading of the Turing machine as an ur-algorithm that has been churning out effective computability abstractions in the minds of its “users” for eighty years. The “thing” that software
…
structures of mathematics. The development of the Church–Turing thesis and the foundations of effective computability created a new linguistic machinery by means of the Turing machine. This conceptual object, this abstraction engine, opened up a space of operations for computation and served the essential function of clearly articulating the nature of
…
Church, Turing, and others created a new kind of certainty, and a new metaphor for thinking with—the universal mathematical ceiling of computability, and the Turing machine, respectively. But they also encoded a new form of ambiguity, or desire, in the boundary region of effective computability as implemented processes. All of this
…
-limited. For engineers it’s a method to solve a problem. For Church, Turing, and the computationalists, the notion of effectively computable problems and the Turing machine itself both depend on processing, on carrying out instructions in finite time. At one level this might seem facile or tautological: the definition of a
…
method must rely on some notion of method. But, like the Turing machine, or Chun’s definition of software, the method has become its own metaphor, more or less visible, for how the algorithm really works as a
…
. 35. Wiener, The Human Use of Human Beings: Cybernetics and Society, 95. 36. Levy, “The Definitive Story of ‘Information Wants to Be Free.’” 37. Rendell, Turing Machine Universality of the Game of Life. 38. Berlinski, The Advent of the Algorithm, 238–248. 39. Hayles, How We Became Posthuman, 13. 40. Ibid., 8
…
, Hope. “Google DeepMind: The Smart Person’s Guide.” TechRepublic, August 3, 2016, http://www.techrepublic.com/article/google-deepmind-the-smart-persons-guide. Rendell, Paul. Turing Machine Universality of the Game of Life. Cham, Switzerland: Springer, 2016. Emergence, Complexity, and Computation 18. Rice, Stephen P. Minding the Machine: Languages of Class in
…
Opponent.” Lubbock Avalanche-Journal (Associated Press Article), May 9, 1997. http://lubbockonline.com/news/051097/kasparov.htm. Figure Credits Figure 1.1: “This is a Turing Machine implemented in Conway’s Game of Life.” Designed by Paul Rendell. Source: http://rendell-attic.org/gol/tm.htm. Figure 1.2: Norbert Wiener and
…
, 205n36 politics of, 45 pragmatist approach and, 19–21 process and, 2, 52, 54 reality and, 205n36 Siri and, 64–65, 82–84 Turing Machine and, 23 (see also Turing Machine) Uber and, 124–126, 129 Wiener and, 28–29, 30 work of algorithms and, 113, 120, 123–136, 139–149 Adams, Douglas, 123
…
, 73, 190 rise of culture machines and, 15–21 (see also Culture machines) Siri and, 59 (see also Siri) traveling salesman problem and Turing Machine and, 9 (see also Turing Machine) as vehicle of computation, 5 wants of, 81–85 Weizenbaum and, 33–40 work of, 113–149 worship of, 192 Al-Khwārizmī, Abū
…
and, 183 Netflix and, 90, 104 ontology and, 8, 22 political critique of, 46 programmability and, 16 Silicon Valley and, 49 Siri and, 65, 77 Turing Machine and, 23 vision of, 43 Computational theocracy, 7, 9 Consciousness coherent subjectivity and, 76–77 computation and, 2, 4, 8, 22–23, 36–37, 40
…
construction and, 154 ontology and, 178 Samantha (Her) and, 77–85, 154 second level of, 78 Siri and, 57–65, 71–84 stream of, 176 Turing Machine and, 23, 184 Turing test and, 43, 79–82, 87, 138, 142, 182 uploading, 36 Convergence Culture (Jenkins), 102 Conversation, 85 building collective, 195 consciousness
…
, 78 data-mining and, 175 as digital process, 191 policies for, 132 Siri and, 57–65, 71–84 Star Trek computer and, 67 Turing Machine and, 182 (see also Turing Machine) Uber and, 130 Conway, John, 29–30 Cool site of the day, 156, 171 Cow Clicker (game) absurdity of, 116, 118 Bogost and
…
–82, 93–96, 121, 159, 189–192 consumer, 93–96, 121, 159 effective computability and, 13, 52 imagination and, 189–192 Netflix and, 93–96 Turing Machine and, 25 Diderot, Denis, 11, 45, 57, 68–69, 72, 74, 156–157 Digital culture, 3, 7, 18, 22, 43, 49, 66, 87, 156, 160
…
proofs and, 24 quest for universal knowledge and, 13 scientific experimentation and, 44 Siri and, 58, 62, 64, 72–76, 81 transformational concept of, 21 Turing Machine and, 41–42 Weizenbaum on, 37–38 Einstein, Albert, 181 ELIZA, 34 Elliptic Curve Digital Signature Algorithm, 163 Embodiment, 10, 26–32, 80, 82 Encryption
…
, 136 Siri and, 57–65, 71–84 spoken, 2, 58, 60, 62–63, 67, 84, 185 symbolic, 2, 26, 38–41 tricks and, 3–4 Turing Machine and, 33, 41 universal, 5 vocabulary and, 2, 4, 25, 138, 160, 190 Wiener and, 28 Language of New Media, The (Manovich), 122 Lawsuits, 90
…
and, 2, 112 Netflix and, 182–183 neural networks and, 28, 31, 39, 182–183, 185 Siri and, 62, 182 (see also Siri) Turing Machine and, 182 (see also Turing Machine) Macy Conferences, 30, 199n42 Madrigal, Alexis, 92, 94–95 Magic agency and, 78 artificial intelligence and, 135–136 cached content and, 159 code
…
of algorithms and, 18, 20 proprietary platforms and, 9 Traveling salesman problem, 19 “Trending Topic” widget, 180 Turing, Alan, 8, 23, 42, 79–80, 182 Turing Machine, 182 Berlinski and, 9, 24 computability boundary and, 23–24 concept of, 23 effective computability and, 42 finite-time processes and, 42 game of life
by Neal Stephenson · 2 May 2000 · 611pp · 186,716 words
a rather tall order," Carl said calmly, "but I accept the invitation. "Okay, do you want a complete grounding in the whole thing, starting with Turing machines, or what?" Carl said pleasantly- humoring her. Miranda decided not to become indignant. They were in a red vinyl booth at a restaurant near the
…
to see how it all comes out now that our fates have become intertwined." "The machines placed a special lock on my door, not a Turing machine," responded the Duke. "Describe yourself," Nell wrote. "Nothing special, - I'm afraid," wrote the Duke. "How about yourself?" "Slightly taller than average, flashing green eyes
…
." "The subject fills me with such unutterable sadness that I cannot bear to write about it. Now, let's buckle down to work on the Turing machine." Since the prurient approach had dead-ended, Nell tried a different tack: playing stupid. Sooner or later, the Duke would become a little testy. But
…
: "I do so envy your skill with words. Now, if you do not object, let us turn our attention to the inner workings of the Turing machine." She had made it as obvious as she dared, and the Duke still hadn't gotten the message. He must be a machine. Why the
…
deception? Clearly, the mechanical Duke desired for her to learn about the Turing machines. That is, if a machine could ever be said to desire something. There must be something wrong with the Duke's programming. He knew there
…
castle was frozen, as if she had cast an enchantment over it. Now roaming freely, she opened up the Duke's throne and found a Turing machine beneath it. On either side of the machine was a narrow hole descending straight through the floor and into the earth for as far as
…
of them were notebooks where he would sketch the inventions he hadn't had time to build yet. He had plans for whole armies of Turing machines made to run in parallel, and for chains with links that could be set in more than two positions, and for machines that would read
…
sheets of chain mail instead of one-dimensional chains, and for a three-dimensional Turing grid a mile on a side, through which a mobile Turing machine would climb about, computing as it went. No matter how complicated his designs became, the Duke always found a way to simulate their behavior by
…
putting a sufficiently long chain into one of the traditional Turing machines. That is to say that while the parallel and multidimensional machines worked more quickly than the original model, they didn't really do anything different
…
them bugs, in reference to a large beetle that had become entangled in one of his chains during an early experiment and brought the first Turing machine to a violent halt. But with steadfast patience, Princess Nell resolved these bugs and made the mechanical Duke into her devoted servant. The Duke in
…
an extremely sophisticated arrangement of water-gates, which meant, in turn, that it could just as well be reduced to an unfathomably long and complicated Turing machine program. When she had the organ working properly and the residents cheered up, she moved on to a castle that functioned according to rules written
…
what was a foregone conclusion, namely, that the system for processing this language was essentially a more complex version of the mechanical organ, hence a Turing machine in essence. Next was a castle divided into many small rooms, with a system for passing messages between rooms through a pneumatic tube. In each
…
, which usually entailed sending more messages to other rooms. After familiarizing herself with some of these rule-books and establishing that the castle was another Turing machine, Princess Nell fixed a problem in the message-delivery system that had been created by the vexatious dark knight, collected another ducal coronet, and moved
…
castles. In other words, once Princess Nell had deciphered the messages, her stall functioned like another Turing machine. It would have been easy enough to conclude that this whole castle was, like the others, a Turing machine. But the Primer had taught Nell to be very careful about making unwarranted assumptions. Just because her
…
according to Turing rules did not mean that all of the others did. And even if every stall in this castle was, in fact, a Turing machine, she still could not come to any fixed conclusions. She had seen riders carrying books to and from the castle, which meant that cipherers must
…
be at work elsewhere in this kingdom. She could not verify that all of them were Turing machines. It did not take long for Nell to attain prosperity here. After a few months (which in the Primer were summarized in as many sentences
…
caught her up in a bewildering logical circle. In Castle Turing she had learned that a Turing machine could not really understand a human being. But the Primer was, itself, a Turing machine, or so she suspected; so how could it understand Nell? Could it be that the Primer was just a conduit, a
…
to study it in detail, but after her experiences in all of King Coyote's other castles, she suspected that it, too, was just another Turing machine. Her study of the Cipherers' Market, and particularly of the rulebooks used by the cipherers to respond to messages, had taught her that for all
…
its complexity, it too was nothing more than another Turing machine. She had come here to the Castle of King Coyote to see whether the King answered his messages according to Turing-like rules. For if
…
he did, then the entire system- the entire kingdom- the entire Land Beyond-was nothing more than a vast Turing machine. And as she had established when she'd been locked up in the dungeon at Castle Turing, communicating with the mysterious Duke by sending messages
…
on a chain, a Turing machine, no matter how complex, was not human. It had no soul. It could not do what a human did. The thirteenth tape was fed into
…
twelfth key." "Anything else?" "To learn about Wizard 0.2." "Ah." "To discover whether it was, in fact, a Turing machine." "Well, you have your answer. Wizard 0.2 is most certainly a Turing machine-the most powerful ever built." "And the Land Beyond?" "All grown from seeds. Seeds that I invented." "And it
…
is also a Turing machine, then? All controlled by Wizard 0.2?" "No," said King Coyote. "Managed by Wizard. Controlled by me." "But the messages in the Cipherers' Market control
…
all the events in the Land Beyond, do they not?" "You are most perceptive, Princess Nell." "Those messages came to Wizard-just another Turing machine." "Open the altar," said King Coyote, pointing to a large brass plate with a keyhole in the middle. Princess Nell used her key to open
…
the Cipherers' Market, I read it myself, and answer it myself. "So as you can see, Princess Nell, the Land Beyond is not really a Turing machine at all. It's actually a person- a few people, to be precise. Now it's all yours." King Coyote led Princess Nell back into
by Robert Elliott Smith · 26 Jun 2019 · 370pp · 107,983 words
a mathematical proof that it could do any mechanical procedure, that could be implemented on any computer, ever. This device, which we now call a Turing Machine, involved configurations of mechanical ‘states’, and the ability to write to and read from memory (in the form of symbols written on an infinitely long
…
roll of tape). In every way, the Turing Machine is like Babbage’s Engine, if that Engine had infinite memory in its ‘store’. In fact, the whole point of Turing’s proof was that
…
of whether it was built on a substrate of brass gears and levers, vacuum tubes, as-yet-uninvented semiconductor chips, or even biological cells, the Turing Machine could implement any algorithm10 that could be implemented on any other computer. It defined the range of what could be computed by algorithms. This is
…
brain is just another mechanical device, a built ‘machine’ that must follow the rules of physics. Therefore, the brain can’t do anything that a Turing machine, and thus any other computer, can’t do. By this argument, the brain is just a computer. Of course, the ultimate ‘capabilities’ assumed in this
…
thought to have shortened the war by at least four years and thus saved millions of lives. His invention of the thought-experiment computer the Turing machine literally created the field of computer science, the bedrock field for an immeasurable fraction of today’s global society. And he created another thought experiment
…
. The next two steps up Chomsky’s hierarchy, the context-sensitive grammars and the recursively enumerable grammars, are similar to one another. They are both Turing machines, the former with finite memory and the latter with infinite memory. In other words, they are the set of languages that can be rendered by
by Ananyo Bhattacharya · 6 Oct 2021 · 476pp · 121,460 words
of a particular type. Later in the paper, he uses these to help build a ‘universal computing machine’ that is capable of simulating any other Turing machine. Computer programmers today would recognize Turing’s strategy: modern programmes make use of libraries of simpler programmes known as ‘subroutines’. Subroutines simplify the structure of
…
easier to understand, improve and troubleshoot. Though Turing describes his computing machine in purely abstract terms, it is quite easy to imagine building one. A Turing machine that can execute a single task might comprise a scanner, print head (erasing characters is admittedly a little trickier) and a motor that moves a
…
another (clean laundry, punched cards with calculated artillery trajectories). The universal machine Turing described, however, is quite different. When fed the instruction table of another Turing machine, the universal machine can simulate it exactly. Turing first describes a system to convert an instruction table into a form that his machines can digest
…
his machines are capable of carrying out any algorithmic process that can be performed by their human counterparts. Conversely, a human may compute anything a Turing machine can – assuming the human in question does not die of boredom first – but nothing that the machine cannot. The universal
…
Turing machine is now considered an abstract prototype of a general-purpose ‘stored program’ computer – one that can, like any laptop or smart phone today, execute an
…
could learn, calculate, store data and execute logical functions – they could, in short, compute. Whether they had ‘proved, in substance, the equivalence of all general Turing machines – man-made or begotten’, as McCulloch later claimed, is a point of contention even today. Von Neumann adopted the terminology and notation of McCulloch and
…
the question ‘can machines reproduce?’ but he would be the first to answer it. At the heart of von Neumann’s theory is the Universal Turing machine. Furnished with a description of any other Turing machine and a list of instructions, the universal machine can imitate it. Von Neumann begins by considering what a
…
Turing-machine-like automaton would need to make copies of itself, rather than just compute. He argues that three things are necessary and sufficient. First, the machine
…
-up, entitled ‘Man Viewed as a Machine’, is barely less sensational than the sci-fi story. ‘Are we, as rational beings, basically different from universal Turing machines?’ he asks. ‘The usual answer is that whatever else machines can do, it still takes a man to build the machine. Who would dare to
…
cells (representing ‘1’).19 Adding a control unit that can read from and write in tape cells, von Neumann is able to reproduce a universal Turing machine in two dimensions. He then designs a constructing arm which snakes out to any cell on the grid, stimulates it into the desired state then
…
had smuggled a trick question into Gardner’s column to tantalize his readers. The glider was the first piece he needed to build a Universal Turing machine within Life. Like von Neumann’s immensely more complicated cellular automaton, Conway wanted to prove that Life would have the power to compute anything. The
…
designed Life organisms capable of executing the basic logical operations and storing data.29 Conway did not bother to finish the job – he knew a Turing machine could be built from the components he had assembled. He had done enough to prove that his automaton could carry out any and all computations
…
myself to write you about a mathematical problem, of which your opinion would very much interest me …’ He then launches into the description of a Turing machine, which if ever shown to actually exist, ‘would have consequences of the greatest importance’. Namely, despite Turing’s negative answer to the Entscheidungsproblem, Gödel said
…
Economic Behavior, Princeton University Press, Princeton. Petzold, Charles, 2008, The Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and the Turing Machine, Wiley, Hoboken. Poundstone, William, 1992, Prisoner’s Dilemma: John von Neumann, Game Theory and the Puzzle of the Bomb, Doubleday, New York. Reid, Constance, 1986
…
Turing’s paper is abridged from Charles Petzold, 2008, The Annotated Turing: A Guided Tour Through Alan Turing’s Historic Paper on Computability and the Turing Machine, Wiley, Hoboken, and ‘Computable Numbers: A Guide’, in Jack B. Copeland (ed.), 2004, The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and
…
something like this: where P0 means ‘print a 0’, P1 means ‘print a 1’ and R means move right one square. 34. Charles Petzold describes Turing machines that can, for example, add and multiply two binary numbers together. See Petzold, The Annotated Turing. 35. Supplied with a copy of the standard description
…
, all the universal machine needs to start work is the initial state of the Turing machine it is imitating and the first symbol that machine is supposed to read. It begins by scanning the standard description on its tape for the
…
this information to hand, the universal machine winds its tape back to where it started, prints the next symbol and the new state of the Turing machine it is simulating. Now the universal machine has a new symbol and state to look for in the standard description on its tape. This cyclical
…
of Automata and Numerical Analysis, Pergamon Press, Oxford. 37. Briefly, Turing’s strategy is this: he begins by considering whether it is possible for some Turing machine to tell from another machine’s standard description whether it will print digits for ever or halt. A little confusingly, he calls machines that print
…
. 28. Quoted in Levy, Artificial Life. 29. These are the AND, OR and NOT operations of Boolean algebra. 30. In 2001, Paul Rendell implemented a Turing machine in Life and, later, a universal version: http://www.rendell-attic.org/gol/tm.htm 31. Quoted in Fred Hapgood, 1987, ‘Let There Be Life
…
123 stored-program 120, 121, 122 see also First Draft of a Report on the EDVAC subroutines 119 Turing’s contribution 118–21 the universal Turing machine 118–21, 306–7n35, 307n37 virus, first 236 VNs contribution 122, 125–76, 129–130, 131, 139–140, 308n48 VNs early interests in 79–80
…
237–41, 243 hexagonal packing of circles 237, 238 Life 239–41, 239, 240, 242, 243, 244, 245, 257 Universal Turing Machine within 241, 243 survey of life forms 240 Universal Turing machine 241, 243 cooperative game theory 172–3, 176, 178, 196–7 Copeland, B. Jack 121–2, 307n37 Copenhagen 58, 76 Copenhagen
…
test 91–2 Turing’s influence 121–2, 301n22 unification of quantum mechanics 30, 36, 37–9, 43–9 unique gift 12–13 on universal Turing machine 120 at University of Budapest 11–13 at University of Berlin 12, 39–41 view of the Cold War 208–9 vision of future technical
…
27, 70, 71–2, 77, 85, 85, 98, 100, 104, 132, 133–4, 136, 234, 241, 272, 279, 282 uncertainty principle 33, 69, 294n11 Universal Turing machine 119–20, 121, 229–30, 235, 241, 243, 306–7n35, 307n37 universal wave function, the 58 University of California in Berkeley 78 uranium, instability 77
by Martin Ford · 13 Sep 2021 · 288pp · 86,995 words
, just two years after he graduated from the University of Cambridge, when he laid out the mathematical principles for what is today called a “universal Turing machine”—essentially the conceptual blueprint for every real-world computer that has ever been built. Turing clearly understood at the very inception of the computer age
by Paul Davies · 31 Jan 2019 · 253pp · 83,473 words
by Melanie Mitchell · 31 Mar 2009 · 524pp · 120,182 words
by Douglas R. Hofstadter · 21 Feb 2011 · 626pp · 181,434 words
by Daniel C. Dennett · 15 Jan 1995 · 846pp · 232,630 words
by Stuart Russell · 7 Oct 2019 · 416pp · 112,268 words
by George Dyson · 28 Mar 2012 · 463pp · 118,936 words
by Max More and Natasha Vita-More · 4 Mar 2013 · 798pp · 240,182 words
by Kenneth Payne · 16 Jun 2021 · 339pp · 92,785 words
by Sharon Bertsch McGrayne · 16 May 2011 · 561pp · 120,899 words
by Brian Christian · 1 Mar 2011 · 370pp · 94,968 words
by Allen B. Downey · 23 Feb 2012 · 247pp · 43,430 words
by John MacCormick and Chris Bishop · 27 Dec 2011 · 250pp · 73,574 words
by Neil A. Gershenfeld · 15 Feb 1999 · 238pp · 46 words
by Simon Singh · 1 Jan 1999
by Ray Kurzweil · 13 Nov 2012 · 372pp · 101,174 words
by John Brockman · 19 Feb 2019 · 339pp · 94,769 words
by James Bridle · 6 Apr 2022 · 502pp · 132,062 words
by Jeffrey D. Sachs · 2 Jun 2020
by Chris Bernhardt · 12 May 2016 · 210pp · 62,771 words
by Andreas M. Antonopoulos and Gavin Wood Ph. D. · 23 Dec 2018 · 960pp · 125,049 words
by David Golumbia · 31 Mar 2009 · 268pp · 109,447 words
by Sinclair McKay · 24 May 2010 · 351pp · 107,966 words
by Nathan L. Ensmenger · 31 Jul 2010 · 429pp · 114,726 words
by Harold Abelson, Gerald Jay Sussman and Julie Sussman · 1 Jan 1984 · 1,387pp · 202,295 words
by Marcus Du Sautoy · 26 Apr 2004 · 434pp · 135,226 words
by Michal Zalewski · 4 Apr 2005 · 412pp · 104,864 words
by George Gilder · 16 Jul 2018 · 332pp · 93,672 words
by Paul J. Nahin · 27 Oct 2012 · 229pp · 67,599 words
by Peter Lunenfeld · 31 Mar 2011 · 239pp · 56,531 words
by Stephen Budiansky · 10 May 2021 · 406pp · 108,266 words
by Scott J. Shapiro · 523pp · 154,042 words
by Peter Gutmann
by Ray Kurzweil · 31 Dec 1998 · 696pp · 143,736 words
by Benjamin H. Bratton · 19 Feb 2016 · 903pp · 235,753 words
by David Deutsch · 31 Mar 2012 · 511pp · 139,108 words
by Michael Wooldridge · 2 Nov 2018 · 346pp · 97,890 words
by Daniel C. Dennett · 7 Feb 2017 · 573pp · 157,767 words
by Erik J. Larson · 5 Apr 2021
by Stuart Russell and Peter Norvig · 14 Jul 2019 · 2,466pp · 668,761 words
by Jane Smiley · 18 Oct 2010 · 253pp · 80,074 words
by Ray Kurzweil · 14 Jul 2005 · 761pp · 231,902 words
by James Gleick · 1 Mar 2011 · 855pp · 178,507 words
by Stephen Hawking · 28 Mar 2007
by M. Mitchell Waldrop · 14 Apr 2001
by Walter Isaacson · 6 Oct 2014 · 720pp · 197,129 words
by Howard Rheingold · 14 May 2000 · 352pp · 120,202 words
by Luke Dormehl · 10 Aug 2016 · 252pp · 74,167 words
by Mo Gawdat · 29 Sep 2021 · 259pp · 84,261 words
by Jim Holt · 14 May 2018 · 436pp · 127,642 words
by Lance Fortnow · 30 Mar 2013 · 236pp · 50,763 words
by George Zarkadakis · 7 Mar 2016 · 405pp · 117,219 words
by William J. Cook · 1 Jan 2011 · 245pp · 12,162 words
by Imran Bashir · 28 Mar 2018
by Jeff Hawkins and Sandra Blakeslee · 1 Jan 2004 · 246pp · 81,625 words
by John Brockman · 5 Oct 2015 · 481pp · 125,946 words
by Jeff Hawkins · 15 Nov 2021 · 253pp · 84,238 words
by Daron Acemoglu and Simon Johnson · 15 May 2023 · 619pp · 177,548 words
by Keith Houston · 22 Aug 2023 · 405pp · 105,395 words
by Chris Bernhardt · 19 Mar 2019 · 211pp · 57,618 words
by Anthony Berglas, William Black, Samantha Thalind, Max Scratchmann and Michelle Estes · 28 Feb 2015
by James Barrat · 30 Sep 2013 · 294pp · 81,292 words
by Pedro Domingos · 21 Sep 2015 · 396pp · 117,149 words
by Jimmy Soni and Rob Goodman · 17 Jul 2017 · 415pp · 114,840 words
by Sonja Thiel and Johannes C. Bernhardt · 31 Dec 2023 · 321pp · 113,564 words
by Robert Harris · 15 Feb 2011 · 387pp · 111,096 words
by Steven Johnson · 329pp · 88,954 words
by Amy Webb · 5 Mar 2019 · 340pp · 97,723 words
by Martin Campbell-Kelly and Nathan Ensmenger · 29 Jul 2013 · 528pp · 146,459 words
by Byron Reese · 23 Apr 2018 · 294pp · 96,661 words
by Christopher Summerfield · 11 Mar 2025 · 412pp · 122,298 words
by Nicole Kobie · 3 Jul 2024 · 348pp · 119,358 words
by Peter Seibel · 22 Jun 2009 · 1,201pp · 233,519 words
by Bruce Schneier · 10 Nov 1993
by Richard Bookstaber · 1 May 2017 · 293pp · 88,490 words
by Werner Loewenstein · 29 Jan 2013 · 362pp · 97,862 words
by J. Craig Venter · 16 Oct 2013 · 285pp · 78,180 words
by Michael Kearns and Aaron Roth · 3 Oct 2019
by Susan Schneider · 1 Oct 2019 · 331pp · 47,993 words
by Tim Berners-Lee · 8 Sep 2025 · 347pp · 100,038 words
by Steven Johnson · 15 Nov 2016 · 322pp · 88,197 words
by Nick Bostrom · 3 Jun 2014 · 574pp · 164,509 words
by Steven Pinker · 1 Jan 1997 · 913pp · 265,787 words
by Yuval Noah Harari · 1 Mar 2015 · 479pp · 144,453 words
by Steven Pinker · 1 Jan 1994 · 661pp · 187,613 words
by Kyle Chayka · 15 Jan 2024 · 321pp · 105,480 words
by Donald E. Knuth · 1 Jan 1974
by Harold Abelson, Gerald Jay Sussman and Julie Sussman · 25 Jul 1996 · 893pp · 199,542 words
by Geoff Cox and Alex McLean · 9 Nov 2012
by Andy Kessler · 13 Jun 2005 · 218pp · 63,471 words
by Brian Christian and Tom Griffiths · 4 Apr 2016 · 523pp · 143,139 words
by John Derbyshire · 14 Apr 2003
by T. R. Reid · 18 Dec 2007 · 293pp · 91,110 words
by Marcus Chown · 22 Apr 2019 · 171pp · 51,276 words
by Charles Stross · 7 Jul 2009
by Markus Krajewski and Peter Krapp · 18 Aug 2011 · 222pp · 74,587 words
by Azeem Azhar · 6 Sep 2021 · 447pp · 111,991 words
by Vikram Chandra · 7 Nov 2013 · 239pp · 64,812 words
by Peter Van-Roy and Seif Haridi · 15 Feb 2004 · 931pp · 79,142 words
by Stross, Charles · 22 Jan 2005 · 489pp · 148,885 words
by Terrence J. Sejnowski · 27 Sep 2018
by Calum Chace · 28 Jul 2015 · 144pp · 43,356 words
by Steven Pinker · 24 Sep 2012 · 1,351pp · 385,579 words
by Robert C. Martin · 13 Oct 2019 · 333pp · 64,581 words
by Karen Hao · 19 May 2025 · 660pp · 179,531 words
by Eliezer Yudkowsky · 11 Mar 2015 · 1,737pp · 491,616 words
by Gardner Dozois · 23 Jun 2009 · 1,263pp · 371,402 words
by Ben Goertzel and Pei Wang · 1 Jan 2007 · 303pp · 67,891 words
by Kim Stanley Robinson · 22 May 2012 · 561pp · 167,631 words
by Kariappa Bheemaiah · 26 Feb 2017 · 492pp · 118,882 words
by George Gilder · 23 Feb 2016 · 209pp · 53,236 words
by Dennis Yi Tenen · 6 Feb 2024 · 169pp · 41,887 words
by William Davies · 26 Feb 2019 · 349pp · 98,868 words
by Gardner R. Dozois · 1 Jan 2005 · 1,280pp · 384,105 words
by Charles Petzold · 28 Sep 1999 · 566pp · 122,184 words
by David A. Mindell · 10 Oct 2002 · 759pp · 166,687 words
by David Berlinski · 2 Jan 2005 · 158pp · 49,168 words
by Tom Chivers · 12 Jun 2019 · 289pp · 92,714 words
by Luciano Floridi · 25 Feb 2010 · 137pp · 36,231 words
by Donald Ervin Knuth · 15 Jan 2001
by Benjamin Peters · 2 Jun 2016 · 518pp · 107,836 words
by David Kahn · 1 Feb 1963 · 1,799pp · 532,462 words
by Michio Kaku · 15 Mar 2011 · 523pp · 148,929 words
by Steve McConnell · 8 Jun 2004 · 1,758pp · 342,766 words
by John D. Barrow · 1 Aug 2005 · 292pp · 88,319 words
by Greg Egan · 1 Jan 1997 · 337pp · 93,245 words
by Parmy Olson · 284pp · 96,087 words
by Gary Marcus and Jeremy Freeman · 1 Nov 2014 · 336pp · 93,672 words
by Michael S. Malone · 20 Jul 2021
by Chris Hanson and Gerald Sussman · 17 Feb 2021
by E. Dijkstra · 15 Feb 1976 · 232pp
by David Gerard · 23 Jul 2017 · 309pp · 54,839 words
by Bill Gates, Nathan Myhrvold and Peter Rinearson · 15 Nov 1995 · 317pp · 101,074 words
by Justin E. H. Smith · 22 Mar 2022 · 198pp · 59,351 words
by John Brockman · 14 Feb 2012 · 416pp · 106,582 words
by Paul Graham · 8 Sep 1993 · 423pp · 21,637 words
by John Cheney-Lippold · 1 May 2017 · 420pp · 100,811 words
by Nick Bostrom · 26 Mar 2024 · 547pp · 173,909 words
by Stross, Charles · 12 Jan 2006
by Gregory Zuckerman · 5 Nov 2019 · 407pp · 104,622 words
by Lisa Gitelman · 25 Jan 2013
by Benjamin C. Pierce · 4 Jan 2002 · 647pp · 43,757 words
by Mark O'Connell · 28 Feb 2017 · 252pp · 79,452 words
by Neal Stephenson · 6 Aug 2012 · 335pp · 107,779 words
by Stross, Charles · 14 Jan 2010 · 366pp · 107,145 words
by Greg Egan · 31 Dec 2003 · 353pp · 101,130 words
by Lee Smolin · 31 Mar 2019 · 385pp · 98,015 words
by Leigh Phillips and Michal Rozworski · 5 Mar 2019 · 202pp · 62,901 words
by Douglas Coupland · 29 Sep 2014 · 124pp · 36,360 words
by Laszlo Bock · 31 Mar 2015 · 387pp · 119,409 words
by Kim Stanley Robinson · 22 Oct 2018 · 492pp · 141,544 words
by Cory Doctorow and Charles Stross · 3 Sep 2012 · 311pp · 94,732 words
by Christopher Allen and Julie Moronuki · 1 Jan 2015 · 1,076pp · 67,364 words
by David J. Leinweber · 31 Dec 2008 · 402pp · 110,972 words
by Chris Okasaki · 12 Apr 1998 · 230pp
by Ron Jeffries · 14 Aug 2015 · 444pp · 118,393 words
by Brooks, Jr. Frederick P. · 1 Jan 1975 · 259pp · 67,456 words
by Joseph E. Stiglitz · 15 Mar 2015 · 409pp · 125,611 words
by Timothy Ferriss · 14 Jun 2017 · 579pp · 183,063 words
by James Dale Davidson and William Rees-Mogg · 3 Feb 1997 · 582pp · 160,693 words
by Stephen Hawking and Leonard Mlodinow · 14 Jun 2010 · 124pp · 40,697 words
by Barrett Brown · 8 Jul 2024 · 332pp · 110,397 words
by VM (Vicky) Brasseur · 266pp · 79,297 words
by Steven Pinker · 1 Jan 2014 · 477pp · 106,069 words