Turing (A Novel about Computation)

Front Cover
MIT Press, Feb 11, 2005 - Fiction - 296 pages
The world of computation according to Turing, an interactive tutoring program, as told to star-crossed lovers: a novel.

Our hero is Turing, an interactive tutoring program and namesake (or virtual emanation?) of Alan Turing, World War II code breaker and father of computer science. In this unusual novel, Turing's idiosyncratic version of intellectual history from a computational point of view unfolds in tandem with the story of a love affair involving Ethel, a successful computer executive, Alexandros, a melancholy archaeologist, and Ian, a charismatic hacker. After Ethel (who shares her first name with Alan Turing's mother) abandons Alexandros following a sundrenched idyll on Corfu, Turing appears on Alexandros's computer screen to unfurl a tutorial on the history of ideas. He begins with the philosopher-mathematicians of ancient Greece—"discourse, dialogue, argument, proof... can only thrive in an egalitarian society"—and the Arab scholar in ninth-century Baghdad who invented algorithms; he moves on to many other topics, including cryptography and artificial intelligence, even economics and developmental biology. (These lessons are later critiqued amusingly and developed further in postings by a fictional newsgroup in the book's afterword.) As Turing's lectures progress, the lives of Alexandros, Ethel, and Ian converge in dramatic fashion, and the story takes us from Corfu to Hong Kong, from Athens to San Francisco—and of course to the Internet, the disruptive technological and social force that emerges as the main locale and protagonist of the novel.

Alternately pedagogical and romantic, Turing (A Novel about Computation) should appeal both to students and professionals who want a clear and entertaining account of the development of computation and to the general reader who enjoys novels of ideas.

 

Selected pages

Contents

The Daemon
139
The Womb
141
Free Market
157
I love You
173
Complexity
177
Kythera
189
Little Things
199
HideandSeek
209

Rusty and Sola
59
Voces
65
Ex Machinae
73
F2F
85
Layers
91
Simulants
109
The Don
117
Runner
133
AI
221
Turings Test
235
Theyll kill me
239
Ian and Turing
241
Turing
243
From the Newsgroup
245
Acknowledgments
283
Copyright

Other editions - View all

Common terms and phrases

Popular passages

Page 19 - Try to run. Try to hide. Break on through to the other side.
Page 166 - I prefer A to B and B to C, then I must prefer A to
Page 214 - me.) Now all we have to do is find a way to
Page 267 - and Computers and Intractability: A Guide to the Theory of NP-completeness by

About the author (2005)

Christos H. Papadimitriou is C. Lester Hogan Professor of Computer Science at the University of California, Berkeley and a member of the National Academy of Engineering and the American Academy of Arts and Sciences. He is the author of many books on computational theory.

Bibliographic information