21 results back to index
pages: 210 words: 62,771 
Turing's Vision: The Birth of Computer Science by Chris Bernhardt Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Ada Lovelace, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, Andrew Wiles, British Empire, cellular automata, Claude Shannon: information theory, complexity theory, Conway's Game of Life, discrete time, Douglas Hofstadter, Georg Cantor, Gödel, Escher, Bach, Henri Poincaré, Internet Archive, Jacquard loom, Jacquard loom, John Conway, John von Neumann, JosephMarie Jacquard, Paul Erdős, Turing complete, Turing machine, Turing test, Von Neumann architecture The ACM named the award after Turing because he is considered as one of the founders of computer science. But why? What did he do to help found computer science? The answer is that he wrote a remarkable paper in 1936, when he was just twenty four years old. This paper is Turing’s most important intellectual contribution. However, this paper and its groundbreaking ideas are not widely known. This book is about that paper. The paper has the rather uninviting title, On Computable Numbers, with an Application to the Entscheidungsproblem. But don’t be discouraged by the title, because it contains a wealth of elegant and powerful results. It also contains some remarkably beautiful proofs. Turing wants to show that a leading mathematician’s view of mathematics is wrong. To do this he needs to study computation: What exactly is computation? How can we define it? Are there problems that cannot be solved by computation? … This idea is then extended to Turing machines: there are some Turing machines that accept their encodings and some that do not, but there is no Turing machine that can distinguish these two classes. This, in turn, leads to the the proofs that certain decision problems are undecidable. In particular, we prove that the halting problem and the acceptance problem are both undecidable. Chapter 8 The title of Turing’s paper is On Computable Numbers, with an Application to the Entscheidungsproblem. The connection to the Entscheidungsproblem has now been explained, but computable numbers have not. In this chapter we explain what these numbers are and the basic result concerning them. The chapter starts with Cantor’s idea of cardinality. We look at some basic, but surprising facts, about infinite cardinal numbers. Cantor’s diagonal and general arguments for showing two sets have different cardinalities are given. … However, we know that b is not on the list of computable numbers. The only conclusion is that the list of computable numbers is not something that can be constructed by a computer. If the list could be constructed by a computer, then b would be computable and we would have a contradiction. If it is not possible to construct the list by a computer, then there is no contradiction, so that must be the case. The title of Turing’s paper is “On Computable Numbers, with An application to the Entscheidungsproblem.” This title should now make sense. Turing wanted to show that Hilbert’s view of the Entscheidungsproblem was not correct. To recap: He first needed to give a definition of an effective procedure, or algorithm. This he did through his definition of what we now call Turing machines. Then Turing needed to find a problem that could not be answered by an algorithm. 
pages: 362 words: 97,862 
Physics in Mind: A Quantum View of the Brain by Werner Loewenstein Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, complexity theory, dematerialisation, discovery of DNA, Gödel, Escher, Bach, Henri Poincaré, informal economy, information trail, Necker cube, stem cell, trade route, Turing machine Woodbridge, CT: Ox Bow Press. 12. How to Represent the World The Universal Turing Machine Hofstadter, D. R. 1980. Gödel, Escher, Bach: An Eternal Braid. New York: Vintage Books, Random House. Trakhtenbrot, B. A. 1963. Algorithms and Automatic Computing Machines. Boston: D.C. Heath & Co. Turing, A. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society (2nd Series) 42:230–265. Turing, A. 1937. On computable numbers, with an application to the Entscheidungsproblem: A correction. Proceedings of the London Mathematical Society 43:544–546. Rendering the World by Computer Deutsch, D. 1985. Quantum theory, the ChurchTuring principle and the universal quantum computer. Proceedings of the Royal Society of London 400:97–117. Deutsch, D. 1997. … An unsolvable problem of elementary number theory. American Journal of Mathematics 58:345–363. Gödel, K. 1931. On formally undecidable propositions of Principia Mathematica and related systems I. Monatsschrift für Mathematik und Physik 38:131–198. Prigogine, I. 1980. From Being to Becoming: Time and Complexity in Physical Sciences. San Francisco: Freeman. Turing, A. M. 1936/1937. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society Series 2 42:230–265 and 43:544–546. A Note about Reality Carroll, Lewis. (1871) 1982. Through the Looking Glass and What Alice Found There, Chapter VII. New York: Avenel Books. 14. Information Processing in the Brain Cell Organization in the Brain Braak, H. 1976. On the striate area of the human isocortex. 
pages: 239 words: 64,812 
Geek Sublime: The Beauty of Code, the Code of Beauty by Vikram Chandra Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Apple II, barriers to entry, Berlin Wall, British Empire, business process, conceptual framework, create, read, update, delete, crowdsourcing, East Village, European colonialism, finite state, Firefox, Flash crash, glass ceiling, haute couture, iterative process, Jaron Lanier, John von Neumann, land reform, London Whale, Paul Graham, pinkcollar, revision control, Silicon Valley, Silicon Valley ideology, Skype, Steve Jobs, Steve Wozniak, Therac25, Turing machine, wikimedia commons, women in the workforce Gnoli and Abhinavagupta, The Aesthetic Experience According to Abhinavagupta, XLIX. 30. MullerOrtega, The Triadic Heart of Śiva, 46. Chapter 10: Application.Restart() 1. MullerOrtega, “Seal of Sambhu,” 574. 2. “Fwd: Amar Chitra Katha Comics in Samskritam: Participate in Readership Survey—Google Groups.” 3. Singh, “New Life, Old Death for Sanskrit in Uttarakhand.” 4. Toole, Ada, the Enchantress of Numbers, loc. 2867–870. 5. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem (1936).” 6. Toole, Ada, the Enchantress of Numbers, loc. 2131–133. 7. Gleick, The Information, loc. 2048–052. 8. Cabanne, Dialogues with Marcel Duchamp, 18–19. 9. Fishwick, “Aesthetic Computing.” 10. Hessel, Goodman, and Kotler, “Hacking the President’s DNA.” 11. Kotler, “Synthetic Biology for Dummies, Investors or Both …”; Carlson, “The Pace and Proliferation of Biological Technologies.” 12. … New York: The Feminist Press at CUNY, 1993. “The International Obfuscated C Code Contest.” Iocc.org. Accessed February 3, 2013. http://www.ioccc.org/. Toole, Betty Alexandra. Ada, the Enchantress of Numbers: Poetical Science. Sausalito: Critical Connection, 2010. Kindle Edition. Torvalds, Linus. “Re: Stable Linux 2.6.25.10.” Gmane.org, July 15, 2008. http://article.gmane.org/gmane.linux.kernel/706950. Turing, Alan. “On Computable Numbers, with an Application to the Entscheidungsproblem (1936).” In The Annotated Turing: A Guided Tour through Alan Turing’s Historic Paper on Computability and the Turing Machine, by Charles Petzold. Indianapolis: Wiley, 2008. Urban, Hugh B. The Economics of Ecstasy: Tantra, Secrecy, and Power in Colonial Bengal. New York: Oxford University Press, 2001. ______. The Power of Tantra: Religion, Sexuality and the Politics of South Asian Studies. 
pages: 372 words: 101,174 
How to Create a Mind: The Secret of Human Thought Revealed by Ray Kurzweil Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, Albert Michelson, anesthesia awareness, anthropic principle, brain emulation, cellular automata, Claude Shannon: information theory, cloud computing, computer age, Dean Kamen, discovery of DNA, en.wikipedia.org, epigenetics, George Gilder, Google Earth, iterative process, Jacquard loom, Jacquard loom, John von Neumann, Law of Accelerating Returns, linear programming, Loebner Prize, mandelbrot fractal, optical character recognition, pattern recognition, Peter Thiel, Ralph Waldo Emerson, random walk, Ray Kurzweil, reversible computing, selfdriving car, speech recognition, Steven Pinker, strong AI, the scientific method, Turing complete, Turing machine, Turing test, Watson beat the top human players on Jeopardy!, X Prize “Overcoming Artificial Stupidity,” WolframAlpha Blog, April 17, 2012, http://blog.wolframalpha.com/author/stephenwolfram/. Chapter 8: The Mind as Computer 1. Salomon Bochner, A Biographical Memoir of John von Neumann (Washington, DC: National Academy of Sciences, 1958). 2. A. M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society Series 2, vol. 42 (1936–37): 230–65, http://www.comlab.ox.ac.uk/activities/ieg/elibrary/sources/tp2ie.pdf. A. M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem: A Correction,” Proceedings of the London Mathematical Society 43 (1938): 544–46. 3. John von Neumann, “First Draft of a Report on the EDVAC,” Moore School of Electrical Engineering, University of Pennsylvania, June 30, 1945. John von Neumann, “A Mathematical Theory of Communication,” Bell System Technical Journal, July and October 1948. 4. 
pages: 903 words: 235,753 
The Stack: On Software and Sovereignty by Benjamin H. Bratton Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
1960s counterculture, 3D printing, 4chan, Ada Lovelace, additive manufacturing, airport security, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, algorithmic trading, Amazon Mechanical Turk, Amazon Web Services, augmented reality, autonomous vehicles, Berlin Wall, bioinformatics, bitcoin, blockchain, Buckminster Fuller, Burning Man, call centre, carbon footprint, carbonbased life, Cass Sunstein, clean water, cloud computing, connected car, corporate governance, crowdsourcing, cryptocurrency, dark matter, David Graeber, deglobalization, dematerialisation, disintermediation, distributed generation, don't be evil, Douglas Engelbart, Edward Snowden, Elon Musk, en.wikipedia.org, Eratosthenes, ethereum blockchain, facts on the ground, Flash crash, Frank Gehry, future of work, Georg Cantor, gig economy, global supply chain, Google Earth, Google Glasses, Guggenheim Bilbao, High speed trading, Hyperloop, illegal immigration, industrial robot, information retrieval, intermodal, Internet of things, invisible hand, Jacob Appelbaum, Jaron Lanier, Jony Ive, Julian Assange, Khan Academy, linked data, Mark Zuckerberg, market fundamentalism, Marshall McLuhan, Masdar, McMansion, means of production, megacity, megastructure, Menlo Park, Minecraft, Monroe Doctrine, Network effects, new economy, offshore financial centre, oil shale / tar sands, packet switching, PageRank, pattern recognition, peak oil, performance metric, Peter Thiel, phenotype, planetary scale, RAND corporation, recommendation engine, reserve currency, RFID, Sand Hill Road, selfdriving car, semantic web, sharing economy, Silicon Valley, Silicon Valley ideology, Slavoj Žižek, smart cities, smart grid, smart meter, social graph, software studies, South China Sea, special economic zone, spectrum auction, Startup school, statistical arbitrage, Steve Jobs, Steven Levy, Stewart Brand, supplychain management, supplychain management software, TaskRabbit, the built environment, The Chicago School, the scientific method, Torches of Freedom, transaction costs, Turing complete, Turing machine, Turing test, universal basic income, urban planning, Vernor Vinge, Washington Consensus, web application, WikiLeaks, working poor, Y Combinator In twelfth century Majorca, Ramon Llull described logical machines, influencing Gottfried Leibniz, who developed a predictive calculus and a biliteral alphabet that, drawing on the I Ching, allowed for the formal reduction of any complex symbolic expression to a sequence of discrete binary states (zero and one, on and off). Later, the formalization of logic within the philosophy mathematics (from PierreSimon Laplace, to Gottlob Frege, Georg Cantor, David Hilbert, and so many others) helped to introduce, inform, and ultimately disprove a version of the Enlightenment as the expression of universal deterministic processes (of both thought and physics). In 1936, with his nowfamous paper, “On Computable Numbers, with an Application to the Entscheidungsproblem,” a very young Alan Turing at once introduced the theoretical basis of modern computing and demonstrated the limits of what could and could not ever be calculated and computed by a universal technology. Turing envisioned his famous “machine” according to the tools of his time to involve an infinite amount of “tape” divided into cells that can store symbols, moved along a stationary readwrite “head” that can alter those symbols, a “state register” that can map the current arrangement of symbols along the tape, and a “table” of instructions that tells the machine to rewrite or erase the symbol and to move the “head,” assuming a new state for the “register” to map. … The photo I describe is from the same series as that used on the cover of the posthumous collection of Deleuze's writings, Desert Islands and Other Texts, 1953–1974 (Cambridge, MA: MIT Press, 2004). Readers may reference the image at this book's companion website, thestack.org. 5. Originally conceived in 1936 by twentyfouryearold Alan Turing and called an “amachine” (for “automatic machine”), it describes a hypothetical universal computer, which, given enough time and energy, would be capable of calculating any “computable” problem. In that paper, “On Computable Numbers, with an Application to the Entscheidungs Problem,” Proceedings of the London Mathematical Society, Ser. 2 42 (1937), Turing demonstrates the range of problems that in fact are not computable. The figure of the Turing machine, as a philosophical and machinic hypothesis, stands for the technology of universal computation and for the ultimate limits of computation within mathematics. 6. Nicholas Gane and Stephen Sale, “Interview with Friedrich Kittler and Mark Hansen,” Theory, Culture, and Society 24 (2007): 323–329. 7. … See also User AI User, 277–279 algorithmic hardware, 348–349 animal User, 274–277 as coUser, 276–277, 349 designing for, 339 enrollment and motivation, 297–298 identifying, 345 machine User, 279–284 rights of, 345 nonpersonhood, 173–175 nonplace, end of, 16 nonstate actors with nationstate functions, 10–11 nonvisual interfaces, 341, 424n41 Nortel patent bid, 134 North American Free Trade Agreement, 443n23 North Sea wind farms proposal (OMA), 181 NoStop City project (Archizoom), 149–151, 160, 178–179 notational systems, 383n4 NSA/CSS Threat Operations Center, US, 441n8 Obama, Barack, 98, 180, 322 ObiWan Kenobi, 176 object identifiers, universal, 214–215 objectinstruments, computational, 227 objects addressability, 214–215 agency of, 131 defined, 402n59 essentials of, 260 identifiers, digital, 207, 214–215 interface design, 230–235 memory of, 212, 215 noncitizen User, 188 objecttoobject communication, 197, 210, 212, 216, 338 objecttoobject spam, 216 reordering by, 206 semantic relations, 202–203 SPIME designation for, 201–204 as symbolic artifacts, 212 ocean exploration, 30 oceanic data centers, 113–114, 140 Oculus, 127 Office of Metropolitan Architecture (OMA), 53, 99, 170, 178, 180–181 offshoring, 443n23 oil geopolity, 99 Oklahoma City Bombing guidelines, 322 “On Computable Numbers, with an Application to the Entscheidungsproblem” (Turing), 78 One57, New York, 311 One Riverside Park, New York, 311 OOZ (Jeremijenko), 276 Open, The (Agamben), 273 OpenFlow, 437n58 open government movement, 121 Open Stack, 174 open systems interconnection (OSI) network model, 61–63 Operation Centurion, Dr. Manuel de la Pila housing block, 312 opinionlessness, state of, 240–241, 426n47 O’Reilly, Tim, 121 Oreskes, Naomi, 457n10 Organized Chaos, forces of, 445n37 Ouroboros energy grid, 92–96, 294–295 Outer Space Treaty, 456n7 “Outline of a Doctrine of French Policy” (Kojève), 109 “Overexposed City, The” (Virilio), 155 ownership competitive, 332 of data, 203, 285, 345–346 economics of, 282 ownerUsers, 285–286, 345–346 Page, Larry, 134, 139, 281, 315 Page Mill Road, 57 “PageRank” (Franceschet), 332 PageRank algorithm, 134, 332 PakistanIndia border, 97, 309 Palace of the Soviets, 181 Palantir, 121, 287, 360, 459n20 Palestine, 120 Panopticon effect, 363 paper envelope, 46 parametricism, 160–161, 162–163 parastates, 446n39 Parker, Sean, 126 Parnet, Clare, 393n50 Parsons, Talcott, 385n25 partition in architecture, 391n30 Patriot Act, US, 120, 363 peertopeer networking, 206, 215 Peirce, Charles Sanders, 211, 223 Perec, Georges, 75 persona design, 254, 255 personality, 277–278 personal mapping technologies, 86, 236, 243, 431n70 personal mobility systems. 
pages: 696 words: 143,736 
The Age of Spiritual Machines: When Computers Exceed Human Intelligence by Ray Kurzweil Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Ada Lovelace, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, Any sufficiently advanced technology is indistinguishable from magic, Buckminster Fuller, call centre, cellular automata, combinatorial explosion, complexity theory, computer age, computer vision, cosmological constant, cosmological principle, Douglas Hofstadter, fudge factor, George Gilder, Gödel, Escher, Bach, I think there is a world market for maybe five computers, information retrieval, invention of movable type, iterative process, Jacquard loom, Jacquard loom, John von Neumann, Law of Accelerating Returns, mandelbrot fractal, Marshall McLuhan, Menlo Park, natural language processing, optical character recognition, pattern recognition, phenotype, Ralph Waldo Emerson, Ray Kurzweil, Schrödinger's Cat, Search for Extraterrestrial Intelligence, selfdriving car, Silicon Valley, speech recognition, Steven Pinker, Stewart Brand, stochastic process, technological singularity, Ted Kaczynski, telepresence, the medium is the message, traveling salesman, Turing machine, Turing test, Whole Earth Review, Y2K ., Computer Models of Thought and Language (San Francisco: W H. Freeman, 1973). 15 Haneef A. Fatmi and R. W Young, “A Definition of Intelligence,” Nature 228 (1970): 97. 16 Alan Turing showed that the essential basis of computation could be modeled with a very simple theoretical machine. He created the first theoretical computer in 1936 (first introduced in Alan M. Turing, “On Computable Numbers with an Application to the Entscheinungs Problem,” Proc. London Math. Soc. 42 [1936]: 230265) in an eponymous conception called the Turing machine. As with a number of Turing’s breakthroughs, he would have both the first and last word. The Turing machine represented the founding of modern computational theory. It has also persisted as our primary theoretical model of a computer because of its combination of simplicity and power.The Turing machine is one example of the simplicity of the foundations of intelligence. … Tufte, Edward R. The Visual Display of Quantitative Information. Cheshire, CT: Graphics Press, 1983. _______. Visual Explanations: Images and Quantities, Evidence and Narrative. Cheshire, CT: Graphics Press, 1997. Turing, Alan. “Computing Machinery and Intelligence.” Reprinted in Minds and Machines, edited by Alan Ross Anderson. Englewood Cliffs, NJ: PrenticeHall, 1964. ________. “On Computable Numbers, with an Application to the Entscheidungsproblem ” Proceedings, London Mathematical Society, 2, no. 42 (1936). Turkle, Sherry. The Second Self: Computers and the Human Spirit. New York: Simon and Schuster, 1984. Tye, Michael. Ten Problems of Consciousness: A Representational Theory of the Phenomenal Mind. Cambridge, MA: MIT Press, 1995. Ullman, Shimon. The Interpretation of Visual Motion. Cambridge, MA: MIT Press, 1982. 
pages: 528 words: 146,459 
Computer: A History of the Information Machine by Martin CampbellKelly, William Aspray, Nathan L. Ensmenger, Jeffrey R. Yost Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Ada Lovelace, air freight, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Apple's 1984 Super Bowl advert, barriers to entry, Bill Gates: Altair 8800, borderless world, Buckminster Fuller, Build a better mousetrap, Byte Shop, card file, cashless society, cloud computing, combinatorial explosion, computer age, don't be evil, Douglas Engelbart, Dynabook, Fellow of the Royal Society, financial independence, game design, garden city movement, informal economy, interchangeable parts, invention of the wheel, Jacquard loom, Jacquard loom, Jeff Bezos, jimmy wales, John von Neumann, linked data, Mark Zuckerberg, Marshall McLuhan, Menlo Park, natural language processing, Network effects, New Journalism, Occupy movement, optical character recognition, packet switching, PageRank, pattern recognition, pirate software, popular electronics, prediction markets, pre–internet, QWERTY keyboard, RAND corporation, Robert X Cringely, Silicon Valley, Silicon Valley startup, Steve Jobs, Steven Levy, Stewart Brand, Ted Nelson, the market place, Turing machine, Vannevar Bush, Von Neumann architecture, Whole Earth Catalog, William Shockley: the traitorous eight, women in the workforce, young professional In short, the Turing Machine embodied all the logical capabilities of a modern computer. Alan Turing was born in 1912 and at school he was drawn to science and practical experimenting. He won a scholarship to King’s College, Cambridge University, and graduated in mathematics with the highest honors in 1934. He became a Fellow of King’s College and, in 1936, published his classic paper “On Computable Numbers with an Application to the Entscheidungsproblem” in which he described the Turing Machine. Turing showed that not all mathematical questions were decidable, and that one could not always determine whether or not a mathematical function was computable. For nonmathematicians this was an obscure concept to grasp, although later—after World War II—Turing explained the idea in an article in Science News. … See NCR National Defense Research Committee (NDRC), 66, 72, 74, 145 National Science Foundation (NSF), 292 National Semiconductor, 221 Nature, 41, 59, 299–300 Nautical Almanac, 4, 7, 47, 52–53 Navigation tables, 4, 47, 53 NCR accounting machines, 31, 38, 53, 117 acquisition of CRC, 117 business software, 122 business strategies of, 30, 34, 123–124, 132 cash registers, 31–32 computer industry and, 98 digital computing machines, 54 as IBM competitor, 133 nonIBMcompatible computers of, 132 postwar business challenges, 103 punchedcard systems, 21, 38 role in computer industry, 21, 117 sales strategies of, 30, 31–32, 36 scanning technology, 164 as software contractors, 177 technical innovation by, 31 user training, 30 Nelson, Ted, 234–235, 237, 279, 286 Netiquette, 285 Netscape Communications Corporation, 289–290 Network analyzers, 48, 50 Network protocols, 285 Networks, 275 New Communalists, 234 New Deal projects, 39 New Product Line (IBM), 126–128, 129 Newman, Max, 82 Nokia, 297, 298 NonIBMcompatible computers, 132 Norris, William, 99, 124, 249 Northrop Aircraft Corporation, 101, 102, 105, 116 Notation, programming, 168 Notebook computers, 296, 298 Noyce, Robert, 219–221, 222, 231, 249 Noyes, Eliot, 120 Nuclear weapons, 65, 74, 78, 109, 127, 149 Numerical meteorology, 50–52 Office machine industry. See Business machine industry Office of Naval Research (ONR), 147–148, 150 Office of Scientific Research and Development (OSRD), 49, 65–66, 74 Office systematizers, 19, 134 Olivetti, 197, 251 Olsen, Kenneth, 217–218 Omidyar, Pierre, 295 “On Computable Numbers with an Application to the Entscheidungsproblem” (Turing), 60 Opel, John, 246 Opensource software, 215, 288, 296 Operating systems for mainframe computers, 179–182, 205, 206, 210, 212–215 for mobile devices, 297, 298 for personal computers, 242–243, 246–247, 253–254, 257–258, 264–267 See also specific operating systems Optical character recognition, 164 OS/2 operating system, 265, 266 OS/360 operating system, 179–182, 183, 212 Osborne 1 computer, 198 (photo), 296 Outsourcing of components and software, 245–246, 247 Oxford English Dictionary, 3 Packaged software programs, 186–188, 254 Packard, David, 249 Packetswitching technology, 281–282 Page, Larry, 294 Palm, Inc., 297, 298 Palo Alto Research Center (PARC), 260, 261, 280, 296 Papian, Bill, 150 Parker, Sean, 301 Pascal programming language, 185 Passages from the Life of a Philosopher (C. 
pages: 405 words: 117,219 
In Our Own Image: Savior or Destroyer? The History and Future of Artificial Intelligence by George Zarkadakis Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
3D printing, Ada Lovelace, agricultural Revolution, Airbnb, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, anthropic principle, Asperger Syndrome, autonomous vehicles, barriers to entry, battle of ideas, Berlin Wall, bioinformatics, British Empire, business process, carbonbased life, cellular automata, Claude Shannon: information theory, combinatorial explosion, complexity theory, continuous integration, Conway's Game of Life, cosmological principle, dark matter, dematerialisation, Douglas Hofstadter, Edward Snowden, epigenetics, Flash crash, Google Glasses, Gödel, Escher, Bach, income inequality, index card, industrial robot, Internet of things, invention of agriculture, invention of the steam engine, invisible hand, Jacquard loom, Jacquard loom, Jacques de Vaucanson, James Watt: steam engine, job automation, John von Neumann, JosephMarie Jacquard, millennium bug, natural language processing, On the Economy of Machinery and Manufactures, packet switching, pattern recognition, Paul Erdős, postindustrial society, prediction markets, Ray Kurzweil, Rodney Brooks, Second Machine Age, selfdriving car, Silicon Valley, speech recognition, stem cell, Stephen Hawking, Steven Pinker, strong AI, technological singularity, The Coming Technological Singularity, the scientific method, Turing complete, Turing machine, Turing test, Tyler Cowen: Great Stagnation, Vernor Vinge, Von Neumann architecture, Watson beat the top human players on Jeopardy!, Y2K ., and Pitts, W. (1943), ‘A logical calculus of the ideas immanent in nervous activity’, in: Bulletin of Mathematical Biophysics (5), pp. 115–33. 6Dehaene, N., and Naccache, L. (2001), ‘Towards a cognitive neuroscience of consciousness: basic evidence of a workspace framework’, in: Cognition, 79 (1–2), pp. 137. 7Artificial Intelligence split from cybernetics in the summer of 1956 with its inaugural conference in Dartmouth, New Hampshire, one year before von Neumann’s death. 8Turing, A. M. (1936), ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, Proceedings of the London Mathematical Society, 2 (1937), 42, pp. 230–65. 9To be more accurate, Gödel encoded metamathematical statements within ordinary arithmetic. 10The incomplete manuscript and notes based on a series of lectures given by von Neumann at the University of Illinois in 1949 was assembled and edited by Arthur Burks and published ten years after von Neumann’s death. 11New findings in epigenetics show that the mechanism of passing hereditary features to future generations is more complex than previously thought, and probably involves other systems in the cell beyond DNA replication. 12The human mind may be beyond logical coding (as Gödel has indirectly showed) but it is not beyond computation. … That was the actual statement that Gödel ‘formalised’. 14To be more precise, Gödel proved that for any computable axiomatic system that is powerful enough to describe arithmetic of the natural numbers (e.g. the Peano axioms) the consistency of the axioms cannot be proven within the system. 15Heisenberg’s uncertainty principle essentially states that we can never know everything about a quantum phenomenon. Therefore, nature will remain forever at least partially unknown to us. 16Turing, A. M. (1936), ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, in: Proceedings of the London Mathematical Society, 1937, Vol. 2, No. 42, pp. 230–65. 17The American mathematician Alonzo Church independently published his proof of the Entscheidungsproblem for the American Mathematical Society using a method called ‘lamda calculus’, and therefore the solution is known as the TuringChurch theorem. (Church, A. (1936), ‘An unsolvable problem of elementary number theory’, in: American Journal of Mathematics, 1936, Vol. 58, pp. 345–63. 18Penrose, R. (1989), The Emperor’s New Mind: Concerning Computers, Minds and the Laws of Physics. 
pages: 158 words: 49,168 
Infinite Ascent: A Short History of Mathematics by David Berlinski Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, Andrew Wiles, Benoit Mandelbrot, Douglas Hofstadter, Eratosthenes, four colour theorem, Georg Cantor, Gödel, Escher, Bach, Henri Poincaré, John von Neumann, Stephen Hawking, Turing machine, William of Occam And so again it is again. Some years after Gödel presented his results, the American logician Alonzo Church defined what he called the lambdacomputable functions. And to roughly the same point since the recursive and the lambdacomputable functions, although quite different, did the same thing and carried on in the same way. In 1936, Alan Turing published the first of his papers on computability, “On Computable Numbers with an Application to the Entscheidungsproblem,” and so gave the idea of an algorithm a vivid and unforgettable metaphor. An effective calculation is any calculation that could be undertaken, Turing argued, by an exceptionally simple imaginary machine, or even a human computer, someone who has, like a clerk in the department of motor vehicles or a college dean, been stripped of all cognitive powers and can as a result execute only a few primitive acts. 
pages: 236 words: 50,763 
The Golden Ticket: P, NP, and the Search for the Impossible by Lance Fortnow Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, Andrew Wiles, Claude Shannon: information theory, cloud computing, complexity theory, Erdős number, four colour theorem, Gerolamo Cardano, John von Neumann, linear programming, new economy, NPcomplete, Occam's razor, P = NP, Paul Erdős, smart grid, Stephen Hawking, traveling salesman, Turing machine, Turing test, Watson beat the top human players on Jeopardy!, William of Occam Trakhtenbrot, “A Survey of Russian Approaches to Prebor (BruteForce Search) Algorithms,” Annals of the History of Computing 6, no. 4 (October 1984): 384–400. Warren McCulloch and Walter Pitts, “A Logical Calculus of the Ideas Immanent in Nervous Activity,” Bulletin of Mathematical Biology 5, no. 4 (1943): 115–33. Panel discussion, Complexity of Computer Computations 40, no. 4 (1972): 169–85. Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society 42 (1936): 230–65. S. Yablonsky, “On the Impossibility of Eliminating PEREBOR in Solving Some Problems of Circuit Theory,” Doklady Akademii Nauk SSSR 124 (1959): 44–47. Y. Zhuravlev, “On the Impossibility of Constructing Minimal Disjunctive Normal Forms for Boolean Functions by Algorithms of a Certain Class, Doklady Akademii Nauk SSSR 132 (1960): 504–6. 
pages: 253 words: 80,074 
The Man Who Invented the Computer by Jane Smiley Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, anticommunist, Arthur Eddington, British Empire, c2.com, computer age, Fellow of the Royal Society, Henri Poincaré, IBM and the Holocaust, John von Neumann, Karl Jansky, RAND corporation, Turing machine, V2 rocket, Vannevar Bush, Von Neumann architecture Andrew Hodges, Turing’s biographer, points out that Turing’s idea “was not only a matter of abstract mathematics, not only a play of symbols, for it involved thinking about what people did in the physical world … His machines—soon to be called Turing Machines—offered a bridge, a connection between abstract symbols and the physical world. Indeed, his imagery was, for Cambridge, almost shockingly industrial.” In May 1936, Alan Turing submitted his paper, entitled “On Computable Numbers, with an Application to the Entscheidungsproblem,” to the Proceedings of the London Mathematical Society and then applied unsuccessfully for a Procter Fellowship at Princeton. As far as anyone in England knew, only Turing and the American Alonzo Church had come up with answers to the Entscheidungsproblem. No mathematician in England was equipped to referee either Turing’s or Church’s paper. Atanasoff and Turing, in their different ways, understood that counting was the future of computing, but the differences between them could not have been more clear—Atanasoff had to invent an actual, physical machine that when turned on would perform a useful function. 
pages: 229 words: 67,599 
The Logician and the Engineer: How George Boole and Claude Shannon Created the Information Age by Paul J. Nahin Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, Any sufficiently advanced technology is indistinguishable from magic, Claude Shannon: information theory, conceptual framework, Fellow of the Royal Society, finite state, four colour theorem, Georg Cantor, John von Neumann, knapsack problem, New Journalism, reversible computing, Schrödinger's Cat, Steve Jobs, Steve Wozniak, thinkpad, Turing machine, Turing test, V2 rocket And second, because of the arbitrarily long length of the tape, a Turing machine has the ability to “remember” what has happened in the arbitrarily distant past. In developing this view of a computing machine, Turing was not suggesting it as a practical design for an actual machine. Rather, as a mathematician he used his machines as a conceptual framework in which to study the limits on just what mechanistic devices can actually compute. Indeed, the title of his 1936 paper, “On Computable Numbers, with an Application to the Entscheidungsproblem’’—that final tonguetwister translates as “the decision problem’’—clearly shows Turing’s intent. His great accomplishment was to show that not all the numbers we can imagine are in fact actually computable. That is, Turing showed there are limits to what a computer—any computer—can do. I’ll return to the concept of a computable number in the final section of this chapter. 9.2 TWO TURING MACHINES As my first specific example of a Turing machine, consider the following statetransition table for a Turing machine that adds any two nonnegative integers m and n that are placed on the tape, leaves their sum on the tape, and then halts. 
pages: 440 words: 109,150 
The Secrets of Station X: How the Bletchley Park codebreakers helped win the war by Michael Smith Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, British Empire, Etonian, haute cuisine, QWERTY keyboard, trade route Throughout 1942, the work on the Tunny material had to be done by hand and, although some useful material was gained on the German campaign against Russia and from the links between Italy and North Africa, many of the messages took several weeks to decypher. Max Newman, one of the mathematicians working in the Testery, was a thin, bald academic from Manchester University, who like Tutte had worked in Tiltman’s research section. He had been Turing’s tutor at one stage. It was Newman’s suggestion that machines might be able to prove mathematical statements that had led Turing to write his groundbreaking paper ‘On Computable Numbers, with an Application to the Entscheidungsproblem’, and Newman who had ensured that it was published. Newman became convinced that, using similar principles to those advocated by Turing, it would be possible to build a machine that, once the patterns of the wheels had been worked out in the Testery, would find the settings of the first row of wheels, thereby making the codebreakers’ task immeasurably easier. 
pages: 370 words: 94,968 
The Most Human Human: What Talking With Computers Teaches Us About What It Means to Be Alive by Brian Christian Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
4chan, Ada Lovelace, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Bertrand Russell: In Praise of Idleness, carbon footprint, cellular automata, Claude Shannon: information theory, cognitive dissonance, complexity theory, crowdsourcing, Donald Trump, Douglas Hofstadter, George Akerlof, Gödel, Escher, Bach, high net worth, Jacques de Vaucanson, Jaron Lanier, job automation, l'esprit de l'escalier, Loebner Prize, Menlo Park, Ray Kurzweil, RFID, Ronald Reagan, Skype, statistical model, Stephen Hawking, Steve Jobs, Steven Pinker, Turing machine, Turing test, Von Neumann architecture, Watson beat the top human players on Jeopardy! Hofstadter, Gödel, Escher, Bach: An Eternal Golden Braid (New York: Basic Books, 1979). 8 Mark Humphrys, “How My Program Passed the Turing Test,” in Parsing the Turing Test, edited by Robert Epstein et al. (New York: Springer, 2008). 9 V. S. Ramachandran and Sandra Blakeslee, Phantoms in the Brain: Probing the Mysteries of the Human Mind (New York: William Morrow, 1998). 10 Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society, 1937, 2nd ser., 42, no. 1 (1937), pp. 230–65. 11 Ada Lovelace’s remarks come from her translation (and notes thereupon) of Luigi Federico Menabrea’s “Sketch of the Analytical Engine Invented by Charles Babbage, Esq.,” in Scientific Memoirs, edited by Richard Taylor (London, 1843). 12 Alan Turing, “Computing Machinery and Intelligence,” Mind 59, no. 236 (October 1950), pp. 433–60. 13 For more on the idea of “radical choice,” see, e.g., Sartre, “Existentialism Is a Humanism,” especially Sartre’s discussion of a painter wondering “what painting ought he to make” and a student who came to ask Sartre’s advice about an ethical dilemma. 14 Aristotle’s arguments: See, e.g., The Nicomachean Ethics. 15 For a publicly traded company: Nobel Prize winner, and (says the Economist) “the most influential economist of the second half of the 20th century,” Milton Friedman wrote a piece in the New York Times Magazine in 1970 titled “The Social Responsibility of Business Is to Increase Its Profits.” 
pages: 387 words: 111,096 
Enigma by Robert Harris Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, British Empire, index card, invention of the printing press, sensible shoes, Turing machine His possessions from his previous address had been delivered to her door that same morning: two boxes of personal effects and an ancient iron bicycle. The bicycle she wheeled into the back yard. The boxes she carried upstairs. One carton was full of books. A couple of Agatha Christies. A Synopsis of Elementary Results in Pure and Applied Mathematics, two volumes, by a fellow named George Shoobridge Garr. Principia Mathematical, whatever that was. A pamphlet with a suspiciously Germanic ring to it—On Computable Numbers, with an Application to the Entscheidungs problem—inscribed 'To Tom, with fond respect, Alan'. More books full of mathematics, one so repeatedly read it was almost falling to pieces and stuffed full of markers—bus and tram tickets, a beer mat, even a blade of grass. It fell open at a heavily underlined passage: there is one purpose at any rate which the real mathematics may serve in war. When the world is mad, a mathematician may find in mathematics an incomparable anodyne. 
pages: 481 words: 125,946 
What to Think About Machines That Think: Today's Leading Thinkers on the Age of Machine Intelligence by John Brockman Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
3D printing, agricultural Revolution, AI winter, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, algorithmic trading, artificial general intelligence, augmented reality, autonomous vehicles, bitcoin, blockchain, clean water, cognitive dissonance, Colonization of Mars, complexity theory, computer age, computer vision, constrained optimization, corporate personhood, cosmological principle, cryptocurrency, cuban missile crisis, dark matter, discrete time, Elon Musk, Emanuel Derman, endowment effect, epigenetics, Ernest Rutherford, experimental economics, Flash crash, friendly AI, Google Glasses, hive mind, income inequality, information trail, Internet of things, invention of writing, iterative process, Jaron Lanier, job automation, John von Neumann, Kevin Kelly, knowledge worker, loose coupling, Moneyball by Michael Lewis explains big data, natural language processing, Network effects, pattern recognition, Peter Singer: altruism, phenotype, planetary scale, Ray Kurzweil, recommendation engine, Republic of Letters, RFID, Richard Thaler, Rory Sutherland, Search for Extraterrestrial Intelligence, selfdriving car, sharing economy, Silicon Valley, Skype, smart contracts, speech recognition, statistical model, stem cell, Stephen Hawking, Steve Jobs, Steven Pinker, Stewart Brand, strong AI, superintelligent machines, supervolcano, the scientific method, The Wisdom of Crowds, Thorstein Veblen, too big to fail, Turing machine, Turing test, Von Neumann architecture, Watson beat the top human players on Jeopardy!, Y2K Nick Bostrom, Superintelligence: Paths, Dangers, Strategies (New York: Oxford University Press, 2014). 5. G. K. Chesterton, Heretics (New York: John Lane, 1905). 6. I. J. Good, “Speculation Concerning the First Ultraintelligent Machine,” Advances in Computers, vol. 6, 1965. 7. Kevin Kelly, “The Technium,” Edge, entry February 3, 2014, https://edge.org/conversation/thetechnium [accessed July 21, 2015]. 8. Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proc. Lond. Math. Soc. 42, series 2 (1936–7): 230–65. 9. Steven Pinker, comment on “The Myth of AI,” Edge, entry November 14, 2014, http://edge.org/conversation/themythofai#25987 [accessed July 21, 2015]. 10. Hannah Arendt, The Life of the Mind, vol. 1 (New York: Harcourt Brace, 1978). 11. Nick Bostrom, “Existential Risks,” Jour. Evol. & Technol. 9, no. 1 (2002), at http://www.nickbostrom.com/existential/risks.html. 12. 
pages: 463 words: 118,936 
Darwin Among the Machines by George Dyson Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Ada Lovelace, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, anticommunist, British Empire, carbonbased life, cellular automata, Claude Shannon: information theory, combinatorial explosion, computer age, Fellow of the Royal Society, finite state, IFF: identification friend or foe, invention of the telescope, invisible hand, Jacquard loom, Jacquard loom, James Watt: steam engine, John Nash: game theory, John von Neumann, Menlo Park, Nash equilibrium, On the Economy of Machinery and Manufactures, packet switching, pattern recognition, phenotype, RAND corporation, spectrum auction, strong AI, the scientific method, The Wealth of Nations by Adam Smith, Turing machine, Von Neumann architecture .: Open Court, 1902), 254. 53.Leibniz to Caroline, Princess of Wales, ca. 1716, in Alexander, Correspondence, 191. CHAPTER 4 1.Alan Turing, “Computing Machinery and Intelligence,” Mind 59 (October 1950): 443. 2.A. K. Dewdney, The Turing Omnibus (Rockville, Md.: Computer Science Press, 1989), 389. 3.Robin Gandy, “The Confluence of Ideas in 1936,” in Rolf Herken, ed., The Universal Turing Machine: A Halfcentury Survey (Oxford: Oxford University Press, 1988), 85. 4.Alan Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society, 2d ser. 42 (1936–1937); reprinted, with corrections, in Martin Davis, ed., The Undecidable (Hewlett, N.Y.: Raven Press, 1965), 117. 5.Ibid., 136. 6.Kurt Gödel, 1946, “Remarks Before the Princeton Bicentennial Conference on Problems in Mathematics,” reprinted in Davis, The Undecidable, 84. 7.W. Daniel Hillis, The Difference That Makes a Difference (New York: Basic Books, forthcoming). 8.Malcolm MacPhail to Andrew Hodges, 17 December 1977, in Andrew Hodges, Alan Turing: The Enigma (New York: Simon & Schuster, 1983), 138. 9.Allan Marquand, “A New Logical Machine,” Proceedings of the American Academy of Arts and Sciences 21 (1885): 303. 10.Charles Peirce to Allan Marquand, 1866, in Arthur W. 

The Science of Language by Noam Chomsky Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Alfred Russel Wallace, British Empire, Brownian motion, dark matter, Drosophila, epigenetics, finite state, Howard Zinn, phenotype, statistical model, stem cell, Steven Pinker Cambridge University Press. Tomalin, Marcus (2003) “Goodman, Quine, and Chomsky: from a grammatical point of view.” Lingua 113: 1223–1253. Tomalin, Marcus (2006) Linguistics and the Formal Sciences: The Origins of Generative Grammar. Cambridge University Press. Tomalin, Marcus (2007) “Reconsidering Recursion in Linguistic Theory.” Lingua 117: 1784–1800. Turing, Alan (1937) “On Computable Numbers, with an Application to the Entscheidungsproblem.” London Mathematical Society, Series 2 42: 230–265. Turing, Alan (1950) “Computing Machinery and Intelligence.” Mind 59: 433–460. Turing, Alan (1992) Collected Works of Alan Turing: Morphogenesis. Ed. P. T. Saunders. Amsterdam: North Holland. Tversky, Amos and Daniel Kahneman (1974) “Judgment under Uncertainty.” Science, New Series 185 (4157): 1124–1131. 

The Singularity Is Near: When Humans Transcend Biology by Ray Kurzweil Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
additive manufacturing, AI winter, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, anthropic principle, Any sufficiently advanced technology is indistinguishable from magic, artificial general intelligence, augmented reality, autonomous vehicles, Benoit Mandelbrot, Bill Joy: nanobots, bioinformatics, brain emulation, Brewster Kahle, Brownian motion, business intelligence, c2.com, call centre, carbonbased life, cellular automata, Claude Shannon: information theory, complexity theory, conceptual framework, Conway's Game of Life, cosmological constant, cosmological principle, cuban missile crisis, data acquisition, Dava Sobel, David Brooks, Dean Kamen, disintermediation, Douglas Hofstadter, en.wikipedia.org, epigenetics, factory automation, friendly AI, George Gilder, Gödel, Escher, Bach, informal economy, information retrieval, invention of the telephone, invention of the telescope, invention of writing, iterative process, Jaron Lanier, Jeff Bezos, job automation, job satisfaction, John von Neumann, Kevin Kelly, Law of Accelerating Returns, life extension, linked data, Loebner Prize, Louis Pasteur, mandelbrot fractal, mutually assured destruction, natural language processing, Network effects, new economy, oil shale / tar sands, optical character recognition, pattern recognition, phenotype, premature optimization, randomized controlled trial, Ray Kurzweil, reversible computing, Rodney Brooks, Search for Extraterrestrial Intelligence, semantic web, Silicon Valley, Singularitarianism, speech recognition, statistical model, stem cell, Stephen Hawking, Stewart Brand, strong AI, superintelligent machines, technological singularity, Ted Kaczynski, telepresence, The Coming Technological Singularity, transaction costs, Turing machine, Turing test, Vernor Vinge, Y2K See the exponential growth of computing graphs in chapter 2 (pp. 67, 70). 26. Alfred N. Whitehead and Bertrand Russell, Principia Mathematica, 3 vols. (Cambridge, U.K.: Cambridge University Press, 1910, 1912, 1913). 27. Gödel's incompleteness theorem first appeared in his "Uberformal unenscheiderbare Satze der Principia Mathematica und verwandter Systeme I," Monatshefte für Mathematik und Physik 38 (1931): 173–98. 28. Alan M. Turing, "On Computable Numbers with an Application to the Entscheidungsproblem," Proceedings of the London Mathematical Society 42 (1936): 23065. The "Entscheidungsproblem" is the decision or halting problem—that is, how to determine ahead of time whether an algorithm will halt (come to a decision) or continue in an infinite loop. 29. Church's version appeared in Alonzo Church, "An Unsolvable Problem of Elementary Number Theory," American Journal of Mathematics 58 (1936): 345–63. 30. 

The Dream Machine: J.C.R. Licklider and the Revolution That Made Computing Personal by M. Mitchell Waldrop Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
Ada Lovelace, air freight, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, anticommunist, Apple II, battle of ideas, Berlin Wall, Bill Duvall, Bill Gates: Altair 8800, Byte Shop, Claude Shannon: information theory, computer age, conceptual framework, cuban missile crisis, Douglas Engelbart, Dynabook, experimental subject, friendly fire, Haight Ashbury, Howard Rheingold, information retrieval, invisible hand, James Watt: steam engine, Jeff Rulifson, John von Neumann, Menlo Park, New Journalism, packet switching, pinkcollar, popular electronics, RAND corporation, RFC: Request For Comment, Silicon Valley, Steve Crocker, Steve Jobs, Steve Wozniak, Steven Levy, Stewart Brand, Ted Nelson, Turing machine, Turing test, Vannevar Bush, Von Neumann architecture, Wiener process "History of the Design of the SAGE ComputerThe AN/FSQ7." Annals of the H15tory ofComput zng 5 (1983). . "A Perspective on SAGE: Discussion." Annals of the H15tory ofComputzng 5 (1983). . "RelIabilIty of Components (Interview with Jay W. Forrester)." Annals of the H15tory ofComputzng 5 (1983). . "Origin of the Term Bit." Annals of the History ofComputzng 6 (1984). Turing, Alan M. "On Computable Numbers, with an ApplIcation to the Entschldungsproblem." Pro ceedzngs of the London Mathematical Soczety 2, no. 42 (1937). . "Computing Machinery and Intelligence." Mind 59, no. 236 (1950). Reprinted In The Mznd's I: Fantaszes and ReflectIOns on Self & Soul, edited by Douglas R. Hofstadter and Daniel C. Dennett. New York: BasIC Books, 1981. Turkle, Sherry. The Second Self: Computers and the Human Spznt. 
pages: 1,351 words: 385,579 
The Better Angels of Our Nature: Why Violence Has Declined by Steven Pinker Amazon: amazon.com — amazon.co.uk — amazon.de — amazon.fr
1960s counterculture, affirmative action, Alan Turing: On Computable Numbers, with an Application to the Entscheidungsproblem, Albert Einstein, availability heuristic, Berlin Wall, British Empire, Broken windows theory, California gold rush, Cass Sunstein, citation needed, clean water, cognitive dissonance, colonial rule, computer age, conceptual framework, correlation coefficient, correlation does not imply causation, crack epidemic, cuban missile crisis, Daniel Kahneman / Amos Tversky, David Brooks, delayed gratification, demographic transition, desegregation, Doomsday Clock, Douglas Hofstadter, Edward Glaeser, en.wikipedia.org, European colonialism, experimental subject, facts on the ground, failed state, firstpastthepost, Flynn Effect, food miles, Francis Fukuyama: the end of history, fudge factor, full employment, ghettoisation, Gini coefficient, global village, Henri Poincaré, impulse control, income inequality, informal economy, invention of the printing press, lake wobegon effect, libertarian paternalism, loss aversion, Marshall McLuhan, McMansion, means of production, metaanalysis, mutually assured destruction, open economy, Peace of Westphalia, Peter Singer: altruism, QWERTY keyboard, race to the bottom, Ralph Waldo Emerson, random walk, Republic of Letters, Richard Thaler, Ronald Reagan, Rosa Parks, Saturday Night Live, security theater, Skype, Slavoj Žižek, South China Sea, statistical model, stem cell, Steven Levy, Steven Pinker, The Wealth of Nations by Adam Smith, transatlantic slave trade, transatlantic slave trade, Turing machine, ultimatum game, V2 rocket, Walter Mischel, WikiLeaks, women in the workforce Trivers, R. L., & Willard, D. E. 1973. Natural selection of parental ability to vary the sex ratio of offspring. Science, 179, 90–91. Tuchman, B. W. 1978. A distant mirror: The calamitous 14th century. New York: Knopf. Tucker, G. R. & Lambert, W. E. 1969. White and Negro listeners’ reactions to various AmericanEnglish dialects. Social Forces, 47, 465–68. Turing, A. M. 1936. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230–65. Turing, A. M. 1950. Computing machinery and intelligence. Mind, 59, 433–60. Turkheimer, E. 2000. Three laws of behavior genetics and what they mean. Current Directions in Psychological Science, 5, 160–64. Turner, H. A. 1996. Hitler’s thirty days to power: January 1933. New York: Basic Books. 