Part 37 (1/2)

35. 35. Robert A. Freitas Jr., private communication to Ray Kurzweil, January 2005. Freitas describes his proposal in detail in Robert A. Freitas Jr., ”Some Limits to Global Ecophagy by Biovorous Nanoreplicators, with Public Policy Recommendations.” Robert A. Freitas Jr., private communication to Ray Kurzweil, January 2005. Freitas describes his proposal in detail in Robert A. Freitas Jr., ”Some Limits to Global Ecophagy by Biovorous Nanoreplicators, with Public Policy Recommendations.”

36. 36. Ralph C. Merkle, ”Self Replicating Systems and Low Cost Manufacturing,” 1994, /nanotech/selfRepNATO.html. Ralph C. Merkle, ”Self Replicating Systems and Low Cost Manufacturing,” 1994, /nanotech/selfRepNATO.html.

37. 37. Neil King Jr. and Ted Bridis, ”FBI System Covertly Searches E-mail,” Neil King Jr. and Ted Bridis, ”FBI System Covertly Searches E-mail,” Wall Street Journal Online Wall Street Journal Online (July 10, 2000), zdnet.com.com/2100-11-522071.html?legacy =zdnn. (July 10, 2000), zdnet.com.com/2100-11-522071.html?legacy =zdnn.

38. 38. Patrick Moore, ”The Battle for Biotech Progress-GM Crops Are Good for the Environment and Human Welfare,” Patrick Moore, ”The Battle for Biotech Progress-GM Crops Are Good for the Environment and Human Welfare,” Greenspirit Greenspirit (February 2004), /logbook.cfm?msid=62. (February 2004), /logbook.cfm?msid=62.

39. 39. ”GMOs: Are There Any Risks?” European Commission (October 9, 2001), europa.eu.int/comm/research/biosociety/pdf/gmo_press_release.pdf. ”GMOs: Are There Any Risks?” European Commission (October 9, 2001), europa.eu.int/comm/research/biosociety/pdf/gmo_press_release.pdf.

40. 40. Rory Carroll, ”Zambians Starve As Food Aid Lies Rejected,” Rory Carroll, ”Zambians Starve As Food Aid Lies Rejected,” Guardian Guardian (October 17, 2002), panies, and governments, and provide specific guidelines to responsibly develop nanotechnology-based molecular manufacturing. The Foresight Guidelines were initially developed at the Inst.i.tute Workshop on Molecular Nanotechnology Research Policy Guidelines, sponsored by the inst.i.tute and the Inst.i.tute for Molecular Manufacturing (IMM), February 1921, 1999. Partic.i.p.ants included James Bennett, Greg Burch, K. Eric Drexler, Neil Jacobstein, Tanya Jones, Ralph Merkle, Mark Miller, Ed Niehaus, Pat Parker, Christine Peterson, Glenn Reynolds, and Philippe Van Nedervelde. The guidelines have been updated several times. The Foresight Guidelines (Foresight Inst.i.tute, version 4.0, October 2004, panies, and governments, and provide specific guidelines to responsibly develop nanotechnology-based molecular manufacturing. The Foresight Guidelines were initially developed at the Inst.i.tute Workshop on Molecular Nanotechnology Research Policy Guidelines, sponsored by the inst.i.tute and the Inst.i.tute for Molecular Manufacturing (IMM), February 1921, 1999. Partic.i.p.ants included James Bennett, Greg Burch, K. Eric Drexler, Neil Jacobstein, Tanya Jones, Ralph Merkle, Mark Miller, Ed Niehaus, Pat Parker, Christine Peterson, Glenn Reynolds, and Philippe Van Nedervelde. The guidelines have been updated several times.

44. 44. Martine Rothblatt, CEO of United Therapeutics, has proposed replacing this moratorium with a regulatory regime in which a new International Xenotransplantation Authority inspects and approves pathogen-free herds of genetically engineered pigs as acceptable sources of xenografts. Rothblatt's solution also helps stamp out rogue xenograft surgeons by promising each country that joins the DCA, and helps to enforce the rules within its borders, a fair share of the pathogenfree xenografts for its own citizens suffering from organ failure. See Martine Rothblatt, ”Your Life or Mine: Using Geoethics to Resolve the Conflict Between Public and Private Interests,” in Martine Rothblatt, CEO of United Therapeutics, has proposed replacing this moratorium with a regulatory regime in which a new International Xenotransplantation Authority inspects and approves pathogen-free herds of genetically engineered pigs as acceptable sources of xenografts. Rothblatt's solution also helps stamp out rogue xenograft surgeons by promising each country that joins the DCA, and helps to enforce the rules within its borders, a fair share of the pathogenfree xenografts for its own citizens suffering from organ failure. See Martine Rothblatt, ”Your Life or Mine: Using Geoethics to Resolve the Conflict Between Public and Private Interests,” in Xenotransplantation Xenotransplantation (Burlington, Vt.: Ashgate, 2004). Disclosure: I am on the board of directors of United Therapeutics. (Burlington, Vt.: Ashgate, 2004). Disclosure: I am on the board of directors of United Therapeutics.

45. 45. See Singularity Inst.i.tute, e possible. SIAI has developed The SIAI Guidelines on Friendly AI: ”Friendly AI,” /. See Singularity Inst.i.tute, e possible. SIAI has developed The SIAI Guidelines on Friendly AI: ”Friendly AI,” /.

46. 46. Integrated Fuel Cell Technologies, ifctech.com. Disclosure: The author is an early investor in and adviser to IFCT. Integrated Fuel Cell Technologies, ifctech.com. Disclosure: The author is an early investor in and adviser to IFCT.

47. 47. New York Times New York Times, September 23, 2003, editorial page.

48. 48. The House Committee on Science of the U.S. House of Representatives held a hearing on April 9, 2003, to ”examine the societal implications of nanotechnology and H.R. 766, the Nanotechnology Research and Development Act of 2002.” See ”Full Science Committee Hearing on the Societal Implications of Nanotechnology,” mdocs.house.gov/committees/science/hsy86340.000/hsy86340_0f.htm. For Ray Kurzweil's testimony, see also mdocs.house.gov/committees/science/hsy86340.000/hsy86340_0f.htm. For Ray Kurzweil's testimony, see also /p/articles/mi_m0ISJ/is_1_42/ai_98695283/print. (March 2003), /p/articles/mi_m0ISJ/is_1_42/ai_98695283/print.

8. 8. Arthur H. Watson and Thomas J. McCabe, ”Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric,” NIST special publication 50035, Computer Systems Laboratory, National Inst.i.tute of Standards and Technology, 1996. Arthur H. Watson and Thomas J. McCabe, ”Structured Testing: A Testing Methodology Using the Cyclomatic Complexity Metric,” NIST special publication 50035, Computer Systems Laboratory, National Inst.i.tute of Standards and Technology, 1996.

9. 9. Mark A. Richards and Gary A. Shaw, ”Chips, Architectures and Algorithms: Reflections on the Exponential Growth of Digital Signal Processing Capability,” submitted to Mark A. Richards and Gary A. Shaw, ”Chips, Architectures and Algorithms: Reflections on the Exponential Growth of Digital Signal Processing Capability,” submitted to IEEE Signal Processing IEEE Signal Processing, December 2004.

10. 10. Jon Bentley, ”Programming Pearls,” Jon Bentley, ”Programming Pearls,” Communications of the ACM Communications of the ACM 27.11 (November 1984): 108792. 27.11 (November 1984): 108792.

11. 11. C. Eldering, M. L. Sylla, and J. A. Eisenach, ”Is There a Moore's Law for Bandwidth,” C. Eldering, M. L. Sylla, and J. A. Eisenach, ”Is There a Moore's Law for Bandwidth,” IEEE Communications IEEE Communications (October 1999): 11721. (October 1999): 11721.

12. 12. J. W. Cooley and J. W. Tukey, ”An Algorithm for the Machine Computation of Complex Fourier Series,” J. W. Cooley and J. W. Tukey, ”An Algorithm for the Machine Computation of Complex Fourier Series,” Mathematics of Computation Mathematics of Computation 19 (April 1965): 297301. 19 (April 1965): 297301.

13. 13. There are an estimated 100 billion neurons with an estimated interneuronal connection ”fan out” of about 1,000, so there are about 100 trillion (10 There are an estimated 100 billion neurons with an estimated interneuronal connection ”fan out” of about 1,000, so there are about 100 trillion (1014) connections. Each connection requires at least 70 bits to store an ID for the two neurons at either end of the connection. So that's approximately 1016 bits. Even the uncompressed genome is about 6 billion bits (about 10 bits. Even the uncompressed genome is about 6 billion bits (about 1010), a ratio of at least 106: 1. See chapter 4.

14. 14. Robert A. Freitas Jr., Robert A. Freitas Jr., Nanomedicine Nanomedicine, vol. I, Basic Capabilities Basic Capabilities, section 6.3.4.2, ”Biological Chemomechanical Power Conversion” (Georgetown, Tex.: Landes Bioscience, 1999), pp. 14748, /NMI/6.3.4.2.htm#p4; see ill.u.s.tration at /NMI/Figures/6.2.jpg.

15. 15. Richard Dawkins, ”Why Don't Animals Have Wheels?” Richard Dawkins, ”Why Don't Animals Have Wheels?” Sunday Times Sunday Times, November 24, 1996, /i.php?id=2002_11_17. Sander Olson, ”Interview with Seth Lloyd,” November 17, 2002, /i.php?id=2002_11_17.

24. 24. Bell, ”Levels and Loops.” Bell, ”Levels and Loops.”

25. 25. See the exponential growth of computing graphs in chapter 2 (pp. 67, 70). See the exponential growth of computing graphs in chapter 2 (pp. 67, 70).

26. 26. Alfred N. Whitehead and Bertrand Russell, Alfred N. Whitehead and Bertrand Russell, Principia Mathematica Principia Mathematica, 3 vols. (Cambridge, U.K.: Cambridge University Press, 1910, 1912, 1913).

27. 27. G.o.del's incompleteness theorem first appeared in his ”Uberformal unenscheiderbare Satze der G.o.del's incompleteness theorem first appeared in his ”Uberformal unenscheiderbare Satze der Principia Mathematica Principia Mathematica und verwandter Systeme I,” und verwandter Systeme I,” Monatshefte fur Mathematik und Physik Monatshefte fur Mathematik und Physik 38 (1931): 17398. 38 (1931): 17398.

28. 28. Alan M. Turing, ”On Computable Numbers with an Application to the Entscheidungsproblem,” Alan M. Turing, ”On Computable Numbers with an Application to the Entscheidungsproblem,” Proceedings of the London Mathematical Society Proceedings of the London Mathematical Society 42 (1936): 230-65. 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. 42 (1936): 230-65. 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.