| 词条 | Claude Shannon |
| 释义 |
|name = Claude Shannon |image =ClaudeShannon MFO3807.jpg |caption = |birth_date = {{birth date|1916|4|30}} |birth_place = Petoskey, Michigan, United States |death_date = {{death date and age|2001|2|24|1916|4|30}} |death_place = Medford, Massachusetts, United States |nationality = American |fields = Mathematics and electronic engineering |workplaces = Bell Labs MIT Institute for Advanced Study |alma_mater = University of Michigan, MIT |doctoral_advisor = Frank Lauren Hitchcock |academic_advisors = |doctoral_students = Danny Hillis Ivan Sutherland Bert Sutherland |notable_students = |known_for ={{collapsible list|title={{nbsp}}|Information theory A Mathematical Theory of Communication A Symbolic Analysis of Relay and Switching Circuits Beta distribution Binary code Block cipher Boolean algebra Channel capacity Computer chess Data compression Digital electronics Digital Revolution Digital subscriber lineEdge coloring Entropy in information theory Entropy (information theory)Entropy power inequality Error-correcting codes with feedback Evaluation function Financial signal processing Information processing Information-theoretic security Innovation (signal processing) Key size Logic gate Logic synthesis Models of communication n-gram Noisy channel coding theorem Nyquist–Shannon sampling theorem One-time pad Product cipher Pulse-code modulation Rate–distortion theory SamplingShannon–Fano coding Shannon–Hartley law Shannon capacity Shannon entropy Shannon's expansion Shannon index Shannon's Maxim Shannon multigraph Shannon number Shannon security Shannon's source coding theorem Shannon switching game Shannon-Weaver model of communication Stream cipher Switching circuit theory Symbolic dynamics Uncertainty coefficient Units of information Useless machine Wearable computer Whittaker–Shannon interpolation formula}} |author_abbrev_bot = |author_abbrev_zoo = |influences = |influenced = |awards = {{no wrap|Stuart Ballantine Medal (1955) IEEE Medal of Honor (1966) National Medal of Science (1966) Harvey Prize (1972) Claude E. Shannon Award (1972) Harold Pender Award (1978) John Fritz Medal (1983) Kyoto Prize (1985) National Inventors Hall of Fame (2004)}} |signature = |footnotes = |thesis1_title = A symbolic analysis of relay and switching circuits |thesis1_url = http://dspace.mit.edu/bitstream/handle/1721.1/11173/34541425-MIT.pdf?sequence=2 |thesis1_year = 1937 |thesis2_title = An Algebra for Theoretical Genetics |thesis2_url = http://dspace.mit.edu/bitstream/handle/1721.1/11174/34541447-MIT.pdf?sequence=2 |thesis2_year = 1940 |religion = }} Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electrical engineer, and cryptographer known as "the father of information theory".[1][2] Shannon is noted for having founded information theory with a landmark paper, A Mathematical Theory of Communication, that he published in 1948. He is also well known for founding digital circuit design theory in 1937, when—as a 21-year-old master's degree student at the Massachusetts Institute of Technology (MIT)—he wrote his thesis demonstrating that electrical applications of Boolean algebra could construct any logical numerical relationship.[3] Shannon contributed to the field of cryptanalysis for national defense during World War II, including his fundamental work on codebreaking and secure telecommunications. BiographyChildhoodShannon was born in Petoskey, Michigan and grew up in Gaylord, Michigan.[4] His father, Claude, Sr. (1862–1934), a descendant of early settlers of New Jersey, was a self-made businessman, and for a while, a Judge of Probate. Shannon's mother, Mabel Wolf Shannon (1890–1945), was a language teacher, and also served as the principal of Gaylord High School. Most of the first 16 years of Shannon's life were spent in Gaylord, where he attended public school, graduating from Gaylord High School in 1932. Shannon showed an inclination towards mechanical and electrical things. His best subjects were science and mathematics. At home he constructed such devices as models of planes, a radio-controlled model boat and a barbed-wire telegraph system to a friend's house a half-mile away.[5] While growing up, he also worked as a messenger for the Western Union company. His childhood hero was Thomas Edison, who he later learned was a distant cousin. Both Shannon and Edison were descendants of John Ogden (1609–1682), a colonial leader and an ancestor of many distinguished people.[6][7] Shannon was apolitical and an atheist.[8] Logic circuitsIn 1932, Shannon entered the University of Michigan, where he was introduced to the work of George Boole. He graduated in 1936 with two bachelor's degrees: one in electrical engineering and the other in mathematics. In 1936, Shannon began his graduate studies in electrical engineering at MIT, where he worked on Vannevar Bush's differential analyzer, an early analog computer.[9] While studying the complicated ad hoc circuits of this analyzer, Shannon designed switching circuits based on Boole's concepts. In 1937, he wrote his master's degree thesis, A Symbolic Analysis of Relay and Switching Circuits.[10] A paper from this thesis was published in 1938.[11] In this work, Shannon proved that his switching circuits could be used to simplify the arrangement of the electromechanical relays that were used then in telephone call routing switches. Next, he expanded this concept, proving that these circuits could solve all problems that Boolean algebra could solve. In the last chapter, he presented diagrams of several circuits, including a 4-bit full adder.[10] Using this property of electrical switches to implement logic is the fundamental concept that underlies all electronic digital computers. Shannon's work became the foundation of digital circuit design, as it became widely known in the electrical engineering community during and after World War II. The theoretical rigor of Shannon's work superseded the ad hoc methods that had prevailed previously. Howard Gardner called Shannon's thesis "possibly the most important, and also the most noted, master's thesis of the century."[12] Shannon received his Ph.D. degree from MIT in 1940. Vannevar Bush had suggested that Shannon should work on his dissertation at the Cold Spring Harbor Laboratory, in order to develop a mathematical formulation for Mendelian genetics. This research resulted in Shannon's PhD thesis, called An Algebra for Theoretical Genetics.[13] In 1940, Shannon became a National Research Fellow at the Institute for Advanced Study in Princeton, New Jersey. In Princeton, Shannon had the opportunity to discuss his ideas with influential scientists and mathematicians such as Hermann Weyl and John von Neumann, and he also had occasional encounters with Albert Einstein and Kurt Gödel. Shannon worked freely across disciplines, and this ability may have contributed to his later development of mathematical information theory.[14] Wartime researchShannon then joined Bell Labs to work on fire-control systems and cryptography during World War II, under a contract with section D-2 (Control Systems section) of the National Defense Research Committee (NDRC). Shannon is credited with the invention of signal-flow graphs, in 1942. He discovered the topological gain formula while investigating the functional operation of an analog computer.[15] For two months early in 1943, Shannon came into contact with the leading British mathematician Alan Turing. Turing had been posted to Washington to share with the U.S. Navy's cryptanalytic service the methods used by the British Government Code and Cypher School at Bletchley Park to break the ciphers used by the Kriegsmarine U-boats in the north Atlantic Ocean.[16] He was also interested in the encipherment of speech and to this end spent time at Bell Labs. Shannon and Turing met at teatime in the cafeteria.[16] Turing showed Shannon his 1936 paper that defined what is now known as the "Universal Turing machine";[17][18] This impressed Shannon, as many of its ideas complemented his own. In 1945, as the war was coming to an end, the NDRC was issuing a summary of technical reports as a last step prior to its eventual closing down. Inside the volume on fire control, a special essay titled Data Smoothing and Prediction in Fire-Control Systems, coauthored by Shannon, Ralph Beebe Blackman, and Hendrik Wade Bode, formally treated the problem of smoothing the data in fire-control by analogy with "the problem of separating a signal from interfering noise in communications systems."[19] In other words, it modeled the problem in terms of data and signal processing and thus heralded the coming of the Information Age. Shannon's work on cryptography was even more closely related to his later publications on communication theory.[20] At the close of the war, he prepared a classified memorandum for Bell Telephone Labs entitled "A Mathematical Theory of Cryptography," dated September 1945. A declassified version of this paper was published in 1949 as "Communication Theory of Secrecy Systems" in the Bell System Technical Journal. This paper incorporated many of the concepts and mathematical formulations that also appeared in his A Mathematical Theory of Communication. Shannon said that his wartime insights into communication theory and cryptography developed simultaneously and that "they were so close together you couldn’t separate them".[21] In a footnote near the beginning of the classified report, Shannon announced his intention to "develop these results … in a forthcoming memorandum on the transmission of information."[22] While he was at Bell Labs, Shannon proved that the cryptographic one-time pad is unbreakable in his classified research that was later published in October 1949. He also proved that any unbreakable system must have essentially the same characteristics as the one-time pad: the key must be truly random, as large as the plaintext, never reused in whole or part, and be kept secret.[23] Information theoryIn 1948, the promised memorandum appeared as "A Mathematical Theory of Communication", an article in two parts in the July and October issues of the Bell System Technical Journal. This work focuses on the problem of how best to encode the information a sender wants to transmit. In this fundamental work, he used tools in probability theory, developed by Norbert Wiener, which were in their nascent stages of being applied to communication theory at that time. Shannon developed information entropy as a measure of the uncertainty in a message while essentially inventing the field of information theory. In 1949 Claude Shannon and Robert Fano devised a systematic way to assign code words based on probabilities of blocks.[24] This technique, known as Shannon-Fano coding, was first proposed in the 1948 article. The book, co-authored with Warren Weaver, The Mathematical Theory of Communication, reprints Shannon's 1948 article and Weaver's popularization of it, which is accessible to the non-specialist. Warren Weaver pointed out that the word "information" in communication theory is not related to what you do say, but to what you could say. That is, information is a measure of one's freedom of choice when one selects a message. Shannon's concepts were also popularized, subject to his own proofreading, in John Robinson Pierce's Symbols, Signals, and Noise. Information theory's fundamental contribution to natural language processing and computational linguistics was further established in 1951, in his article "Prediction and Entropy of Printed English", showing upper and lower bounds of entropy on the statistics of English – giving a statistical foundation to language analysis. In addition, he proved that treating whitespace as the 27th letter of the alphabet actually lowers uncertainty in written language, providing a clear quantifiable link between cultural practice and probabilistic cognition. Another notable paper published in 1949 is "Communication Theory of Secrecy Systems", a declassified version of his wartime work on the mathematical theory of cryptography, in which he proved that all theoretically unbreakable ciphers must have the same requirements as the one-time pad. He is also credited with the introduction of sampling theory, which is concerned with representing a continuous-time signal from a (uniform) discrete set of samples. This theory was essential in enabling telecommunications to move from analog to digital transmissions systems in the 1960s and later. He returned to MIT to hold an endowed chair in 1956. Teaching at MITIn 1956 Shannon joined the MIT faculty to work in the Research Laboratory of Electronics (RLE). He continued to serve on the MIT faculty until 1978. Later lifeShannon developed Alzheimer's disease and spent the last few years of his life in a nursing home in Massachusetts oblivious to the marvels of the digital revolution he had helped create. He died in 2001. He was survived by his wife, Mary Elizabeth Moore Shannon, his son, Andrew Moore Shannon, his daughter, Margarita Shannon, his sister, Catherine Shannon Kay, and his two granddaughters.[25][26] His wife stated in his obituary that, had it not been for Alzheimer's disease, "He would have been bemused" by it all.[29] Hobbies and inventionsOutside of Shannon's academic pursuits, he was interested in juggling, unicycling, and chess. He also invented many devices, including a Roman numeral computer called THROBAC, juggling machines, and a flame-throwing trumpet.[27] One of his more humorous devices was a box kept on his desk called the "Ultimate Machine", based on an idea by Marvin Minsky. Otherwise featureless, the box possessed a single switch on its side. When the switch was flipped, the lid of the box opened and a mechanical hand reached out, flipped off the switch, then retracted back inside the box. In addition, he built a device that could solve the Rubik's Cube puzzle.[6] Shannon designed the Minivac 601, a digital computer trainer to teach business people about how computers functioned. It was sold by the Scientific Development Corp starting in 1961. He is also considered the co-inventor of the first wearable computer along with Edward O. Thorp.[28] The device was used to improve the odds when playing roulette. Personal lifeShannon married Norma Levor, a wealthy, Jewish, left-wing intellectual in January 1940. The marriage ended in divorce after about a year. Levor later married Ben Barzman.[29] Shannon met his second wife Betty Shannon (née Mary Elizabeth Moore) when she was a numerical analyst at Bell Labs. They were married in 1949.[25] Betty assisted Claude in building some of his most famous inventions.[30] Claude and Betty Shannon had three children, Robert James Shannon, Andrew Moore Shannon, and Margarita Shannon, and raised his family in Winchester, Massachusetts. Their oldest son, Robert Shannon, died in 1998 at the age of 45. After suffering the progressive declines of Alzheimer's disease over some years, Shannon died at the age of 84, on February 24, 2001.[31] TributesTo commemorate Shannon's achievements, there were celebrations of his work in 2001. There are currently six statues of Shannon sculpted by Eugene Daub: one at the University of Michigan; one at MIT in the Laboratory for Information and Decision Systems; one in Gaylord, Michigan; one at the University of California, San Diego; one at Bell Labs; and another at AT&T Shannon Labs.[32] After the breakup of the Bell System, the part of Bell Labs that remained with AT&T Corporation was named Shannon Labs in his honor. According to Neil Sloane, an AT&T Fellow who co-edited Shannon's large collection of papers in 1993, the perspective introduced by Shannon's communication theory (now called information theory) is the foundation of the digital revolution, and every device containing a microprocessor or microcontroller is a conceptual descendant of Shannon's publication in 1948:[33] "He's one of the great men of the century. Without him, none of the things we know today would exist. The whole digital revolution started with him."[34] The unit shannon is named after Claude Shannon. A Mind at Play, a biography of Shannon written by Jimmy Soni and Rob Goodman, was published in 2017.[35]On April 30, 2016 Shannon was honored with a Google Doodle to celebrate his life on what would have been his 100th birthday.[36][37][38][39][40][41] Other workShannon's mouse"Theseus", created in 1950, was a magnetic mouse controlled by an electromechanical relay circuit that enabled it to move around a labyrinth of 25 squares. Its dimensions were the same as those of an average mouse.[2] The maze configuration was flexible and it could be modified arbitrarily by rearranging movable partitions.[2] The mouse was designed to search through the corridors until it found the target. Having travelled through the maze, the mouse could then be placed anywhere it had been before, and because of its prior experience it could go directly to the target. If placed in unfamiliar territory, it was programmed to search until it reached a known location and then it would proceed to the target, adding the new knowledge to its memory and learning new behavior.[2] Shannon's mouse appears to have been the first artificial learning device of its kind.[2] Shannon's estimate for the complexity of chess{{Main|Shannon number}}In 1949 Shannon completed a paper (published in March 1950) which estimates the game-tree complexity of chess, which is approximately 10120. This number is now often referred to as the "Shannon number", and is still regarded today as an accurate estimate of the game's complexity. The number is often cited as one of the barriers to solving the game of chess using an exhaustive analysis (i.e. brute force analysis).[42][43] Shannon's computer chess programOn March 9, 1949, Shannon presented a paper called "Programming a Computer for playing Chess." The paper was presented at the National Institute for Radio Engineers Convention in New York. He described how to program a computer to play chess based on position scoring and move selection. He proposed basic strategies for restricting the number of possibilities to be considered in a game of chess. In March 1950 it was published in Philosophical Magazine, and is considered one of the first articles published on the topic of programming a computer for playing chess, and using a computer to solve the game.[42][44] His process for having the computer decide on which move to make was a minimax procedure, based on an evaluation function of a given chess position. Shannon gave a rough example of an evaluation function in which the value of the black position was subtracted from that of the white position. Material was counted according to the usual chess piece relative value (1 point for a pawn, 3 points for a knight or bishop, 5 points for a rook, and 9 points for a queen).[45] He considered some positional factors, subtracting ½ point for each doubled pawn, backward pawn, and isolated pawn. Another positional factor in the evaluation function was mobility, adding 0.1 point for each legal move available. Finally, he considered checkmate to be the capture of the king, and gave the king the artificial value of 200 points. Quoting from the paper: The coefficients .5 and .1 are merely the writer's rough estimate. Furthermore, there are many other terms that should be included. The formula is given only for illustrative purposes. Checkmate has been artificially included here by giving the king the large value 200 (anything greater than the maximum of all other terms would do). The evaluation function was clearly for illustrative purposes, as Shannon stated. For example, according to the function, pawns that are doubled as well as isolated would have no value at all, which is clearly unrealistic. Shannon's maximShannon formulated a version of Kerckhoffs' principle as "The enemy knows the system". In this form it is known as "Shannon's maxim". CommemorationsShannon Centenary{{Update-section|date=April 2016}}The Shannon Centenary, 2016, marked the life and influence of Claude Elwood Shannon on the hundredth anniversary of his birth on April 30, 1916. It was inspired in part by the Alan Turing Year. An ad hoc committee of the IEEE Information Theory Society including Christina Fragouli, Rüdiger Urbanke, Michelle Effros, Lav Varshney and Sergio Verdú,[46] coordinated worldwide events. The initiative was announced in the History Panel at the 2015 IEEE Information Theory Workshop Jerusalem[47][48] and the IEEE Information Theory Society Newsletter.[49] A detailed listing of confirmed events was available on the website of the IEEE Information Theory Society.[50] Some of the planned activities included:
Awards and honors listThe Claude E. Shannon Award was established in his honor; he was also its first recipient, in 1972.[57] {{Div col}}
See also{{Portal|Systems science}}{{Div col|colwidth=20em|small=yes}}
References1. ^{{Cite journal | last1 = James | first1 = I. | authorlink = Ioan James | doi = 10.1098/rsbm.2009.0015 | title = Claude Elwood Shannon 30 April 1916 – 24 February 2001 | journal = Biographical Memoirs of Fellows of the Royal Society | volume = 55 | pages = 257–265 | year = 2009 | pmid = | pmc = }} 2. ^1 2 3 4 {{cite web|url=http://www.alcatel-lucent.com/wps/portal/!ut/p/kcxml/04_Sj9SPykssy0xPLMnMz0vM0Y_QjzKLd4w39w3RL8h2VAQAGOJBYA!!?LMSG_CABINET=Bell_Labs&LMSG_CONTENT_FILE=News_Features/News_Feature_Detail_000025|archiveurl=https://web.archive.org/web/20120722011711/http://www.alcatel-lucent.com/wps/portal/%21ut/p/kcxml/04_Sj9SPykssy0xPLMnMz0vM0Y_QjzKLd4w39w3RL8h2VAQAGOJBYA%21%21?LMSG_CABINET=Bell_Labs&LMSG_CONTENT_FILE=News_Features%2FNews_Feature_Detail_000025|title=Bell Labs Advances Intelligent Networks|archivedate=July 22, 2012|deadurl=yes|df=mdy-all}} 3. ^{{cite book |last= Poundstone |first=William |title=Fortune's Formula : The Untold Story of the Scientific Betting System That Beat the Casinos and Wall Street |location= |publisher=Hill & Wang |year=2005 |isbn=978-0-8090-4599-0 }} 4. ^{{cite web|title=Claude Shannon|url=http://www.nyu.edu/pages/linguistics/courses/v610003/shan.html|website=nyu.edu|accessdate=September 10, 2014}} 5. ^[https://www.nytimes.com/2001/12/30/magazine/the-lives-they-lived-claude-shannon-b-1916-bit-player.html?mcubz=1 "The Lives They Lived: Claude Shannon", New York Times, 30 December 2001] 6. ^1 MIT Professor Claude Shannon dies; was founder of digital communications, MIT — News office, Cambridge, Massachusetts, February 27, 2001 7. ^{{cite book| title=Claude Elwood Shannon: Collected Papers | editor1-first=N.J.A | editor1-last=Sloane | editor2-first=Aaron D. | editor2-last=Wyner | publisher=Wiley/IEEE Press | isbn=978-0-7803-0434-5 | date=1993 | url=http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0780304349.html | accessdate=9 December 2016 }} 8. ^{{cite book|title=Fortune's Formula: The Untold Story of the Scientific Betting System|year=2010|publisher=Macmillan|isbn=978-0-374-70708-8|page=18|author=William Poundstone|quote=Shannon described himself as an atheist and was outwardly apolitical.}} 9. ^{{cite web |url=http://www.ieeeghn.org/wiki/index.php/Oral-History:Claude_E._Shannon |title=Claude E. Shannon, an oral history |author=Robert Price |work=IEEE Global History Network |year=1982 |publisher=IEEE |accessdate=July 14, 2011}} 10. ^1 Claude Shannon, "A Symbolic Analysis of Relay and Switching Circuits," unpublished MS Thesis, Massachusetts Institute of Technology, August 10, 1937. 11. ^{{ cite journal|last = Shannon|first = C. E.|title = A Symbolic Analysis of Relay and Switching Circuits|journal = Trans. AIEE|year = 1938|volume = 57 |issue=12|pages = 713–723|doi= 10.1109/T-AIEE.1938.5057767|hdl = 1721.1/11173}} 12. ^{{cite book |title=The Mind's New Science: A History of the Cognitive Revolution |first=Howard |last=Gardner |authorlink=Howard Gardner |publisher=Basic Books |year=1987 |isbn=978-0-465-04635-5 |page=144}} 13. ^C. E. Shannon, "An algebra for theoretical genetics," (Ph.D. Thesis, Massachusetts Institute of Technology, 1940), MIT-THESES//1940–3 Online text at MIT — Contains a biography on pp. 64–65. 14. ^Erico Marui Guizzo, “The Essential Message: Claude Shannon and the Making of Information Theory” (M.S. Thesis, Massachusetts Institute of Technology, Dept. of Humanities, Program in Writing and Humanistic Studies, 2003), 14. 15. ^{{Cite book|title = NASAP-70 User's and Programmer's manual|last = Okrent|first = Howard|publisher = School of Engineering and Applied Science, University of California at Los Angeles|year = 1970|isbn = |location = Los Angeles, California|pages = 3–9|first2 = Lawrence P.|last2 = McNamee|chapter-url = https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19710025849.pdf|chapter = 3. 3 Flowgraph Theory|accessdate = 2016-03-04}} 16. ^1 {{Citation | last = Hodges | first = Andrew | author-link = Andrew Hodges | year = 1992 | title = Alan Turing: The Enigma | location = London | publisher = Vintage | pages = 243–252 | isbn = 978-0-09-911641-7| title-link = Alan Turing: The Enigma }} 17. ^{{Citation | last= Turing | first= A.M. | publication-date = 1937 | year = 1936 | title = On Computable Numbers, with an Application to the Entscheidungsproblem | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 42 | pages = 230–65 | doi= 10.1112/plms/s2-42.1.230 }} 18. ^{{Citation | last = Turing | first = A.M. | publication-date = 1937 | title = On Computable Numbers, with an Application to the Entscheidungsproblem: A correction | periodical = Proceedings of the London Mathematical Society | series = 2 | volume = 43 | pages = 544–6 | doi = 10.1112/plms/s2-43.6.544 | year = 1938 | issue = 6 }} 19. ^David A. Mindell, Between Human and Machine: Feedback, Control, and Computing Before Cybernetics, (Baltimore: Johns Hopkins University Press), 2004, pp. 319-320. {{ISBN|0-8018-8057-2}}. 20. ^David Kahn, The Codebreakers, rev. ed., (New York: Simon and Schuster), 1996, pp. 743–751. {{ISBN|0-684-83130-9}}. 21. ^quoted in Kahn, The Codebreakers, p. 744. 22. ^quoted in Erico Marui Guizzo, "The Essential Message: Claude Shannon and the Making of Information Theory," {{webarchive |url=https://web.archive.org/web/20080528182200/http://dspace.mit.edu/bitstream/1721.1/39429/1/54526133.pdf |date=May 28, 2008 }} unpublished MS thesis, Massachusetts Institute of Technology, 2003, p. 21. 23. ^Shannon, Claude (1949). "Communication Theory of Secrecy Systems". Bell System Technical Journal 28 (4): 656–715. 24. ^{{cite book|last=Wolfram|first=Stephen|title=A New Kind of Science|publisher=Wolfram Media, Inc.|year=2002|page=1069|isbn=978-1-57955-008-0}} 25. ^1 {{cite web| url=http://scienceworld.wolfram.com/biography/Shannon.html | title=Shannon, Claude Elwood (1916–2001) | first=Eric | last=Weisstein | work=World of Scientific Biography | publisher=Wolfram Research }} 26. ^{{cite web | url=http://www.thocp.net/biographies/shannon_claude.htm | title=Claude Shannon – computer science theory | work=www.thocp.net | publisher=The History of Computing Project | accessdate=9 December 2016}} 27. ^{{cite web| url=https://webmuseum.mit.edu/detail.php?module=people&type=related&kv=12372 | title=People: Shannon, Claude Elwood | publisher=MIT Museum | accessdate=9 December 2016 }} 28. ^The Invention of the First Wearable Computer Online paper by Edward O. Thorp of Edward O. Thorp & Associates 29. ^{{cite book | author = Jimmy Soni| author2 = Rob Goodman| title = A Mind At Play: How Claude Shannon Invented the Information Age| publisher = Simon and Schuster| year = 2017| pages = 63, 80 }} 30. ^{{Cite news|url=https://blogs.scientificamerican.com/observations/betty-shannon-unsung-mathematical-genius/|title=Betty Shannon, Unsung Mathematical Genius|work=Scientific American Blog Network|access-date=2017-07-26|language=en}} 31. ^{{Cite news|url=https://www.nytimes.com/2001/02/27/nyregion/claude-shannon-mathematician-dies-at-84.html|title=Claude Shannon, Mathematician, Dies at 84|last=Johnson|first=George|access-date=2018-10-04|language=en}} 32. ^{{cite web|url=http://www.eecs.umich.edu/shannonstatue/|title=Claude Shannon Statue Dedications|deadurl=yes|archiveurl=https://web.archive.org/web/20100731230211/http://www.eecs.umich.edu/shannonstatue/|archivedate=July 31, 2010|df=mdy-all}} 33. ^C. E. Shannon: A mathematical theory of communication. Bell System Technical Journal, vol. 27, pp. 379–423 and 623–656, July and October 1948 34. ^1 Bell Labs digital guru dead at 84 — Pioneer scientist led high-tech revolution (The Star-Ledger, obituary by Kevin Coughlin February 27, 2001) 35. ^{{cite web | url = https://www.wsj.com/articles/the-elegance-of-ones-and-zeroes-1500667513 | title = The Elegance of Ones and Zeroes | date= 21 July 2017 | accessdate = 15 August 2017 | publisher = Wall Street Journal | author = George Dyson }} 36. ^[https://www.google.com/doodles/claude-shannons-100th-birthday Claude Shannon’s 100th birthday] Google, 2016 37. ^{{cite news|author1=Katie Reilly|title=Google Doodle Honors Mathematician-Juggler Claude Shannon|url=http://time.com/4313341/google-doodle-claude-shannon/|publisher=Time|date=April 30, 2016}} 38. ^{{cite news|author1=Menchie Mendoza|title=Google Doodle Celebrates 100th Birthday Of Claude Shannon, Father Of Information Theory|url=http://www.techtimes.com/articles/155386/20160502/google-doodle-celebrates-100th-birthday-of-claude-shannon-father-of-information-theory.htm|publisher=Tech Times|date=2 May 2016}} 39. ^{{cite news|title=Google Doodle commemorates 'father of information theory' Claude Shannon on his 100th birthday|url=http://www.firstpost.com/tech/news-analysis/google-doodle-celebrates-father-of-information-theory-claude-shannons-100th-birthday-3681089.html|publisher=Firstpost|date=May 3, 2016}} 40. ^{{cite news|author1=Jonathan Gibbs|title=Claude Shannon: Three things you'll wish you owned that the mathematician invented|publisher=The Independent|date=29 April 2016}} 41. ^{{cite news|author1=David Z. Morris|title=Google Celebrates 100th Birthday of Claude Shannon, the Inventor of the Bit|url=http://fortune.com/2016/04/30/google-claude-shannon-bit-inventor/|publisher=Fortune|date=April 30, 2016}} 42. ^1 {{cite journal | author = Claude Shannon | title = Programming a Computer for Playing Chess | journal = Philosophical Magazine | volume = 41 | issue = 314 | year = 1950 | url = http://archive.computerhistory.org/projects/chess/related_materials/text/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon/2-0%20and%202-1.Programming_a_computer_for_playing_chess.shannon.062303002.pdf}} 43. ^Dr. James Grime. [https://www.youtube.com/watch?v=Km024eldY1A "How many chess games are possible? (films by Brady Haran). MSRI, Mathematical Sciences".] Numberphile, July 24, 2015. 44. ^http://billwall.phpwebhosting.com/articles/computer_early_chess.htm 45. ^{{Citation | title = Artificial dreams: the quest for non-biological intelligence | author = Hamid Reza Ekbia | year = 2008 | isbn = 978-0-521-87867-8 | page = 46 | publisher = Cambridge University Press }} 46. ^{{cite web| url=http://www.itsoc.org/publications/newsletters/june-2015-issue/at_download/file | title=Newsletter | work=IEEE Information Theory Society | publisher=IEEE | date=June 2015 }} 47. ^{{cite web|url=http://itw2015.eew.technion.ac.il/photos/videos/ | title=Videos | publisher=Technion | location=Israel }} 48. ^{{cite web|url=https://twitter.com/Sergio_Verdu/status/593697587540008961 | title=Sergio Verdú|work=Twitter }} 49. ^{{cite web| url=http://www.itsoc.org/publications/newsletters/september-2014-issue-1/at_download/file | title=Newsletter | work=IEEE Information Theory Society | publisher=IEEE | date=September 2014 }} 50. ^{{cite web|url=http://www.itsoc.org/resources/Shannon-Centenary/ | title=Shannon Centenary | work=IEEE Information Theory Society | publisher=IEEE }} 51. ^{{cite web|url=http://www.itsoc.org/about/shannons-centenary-us-postal-stamp|title=Shannon's centenary US postal stamp}} 52. ^{{cite web|url=http://georgeboole.com/events/conferences/when-boole-meets-shannon-2nd-i-risc-workshop.html|title=-George Boole 200-Conferences|access-date=September 21, 2015|archive-url=https://web.archive.org/web/20150906204143/http://georgeboole.com/events/conferences/when-boole-meets-shannon-2nd-i-risc-workshop.html|archive-date=September 6, 2015|dead-url=yes|df=mdy-all}} 53. ^{{cite web|url=http://booleshannon.mit.edu/|title=Compute and Communicate – A Boole/Shannon Celebration}} 54. ^{{cite web|url=http://coord.info/GC6ACQE|title=GC6ACQE Shanniversary #1: Information Theory (DE/EN) (Traditional Cache) in Bayern, Germany created by sigurd_fjoelskaldr|author=Geocaching}} 55. ^{{cite web|url=http://www.crowdspring.com/logo-design/2390839_claude-shannon-centennial-logo/entry/7416728_logo-design/|title=crowdSPRING}} 56. ^{{cite web|url=https://www.win.tue.nl/~wstomv/talks/momath/ | title=Saving Face: Information Tricks for Love and Life (Math Encounters Presentation at the National Museum of Mathematics|publisher=)}} 57. ^{{cite web|url=http://www.newyorker.com/tech/elements/claude-shannon-the-father-of-the-information-age-turns-1100100|title=Claude Shannon, the Father of the Information Age, Turns 1100100|last=Roberts|first=Siobhan|authorlink=Siobhan Roberts|date=30 April 2016|work=The New Yorker|accessdate=30 April 2016}} 58. ^{{cite web|url=http://www.ieee.org/documents/liebmann_rl.pdf|archiveurl=https://web.archive.org/web/20160303211541/http://www.ieee.org/documents/liebmann_rl.pdf|archivedate=2016-03-03 |title=IEEE Morris N. Liebmann Memorial Award Recipients |publisher=IEEE |accessdate=February 27, 2011}} 59. ^{{cite web | title=Claude Shannon | website=National Academy of Sciences | date=2 July 2015 | url=http://www.nasonline.org/member-directory/deceased-members/50590.html | access-date=25 March 2019}} 60. ^{{cite web|url=http://www.ieee.org/documents/moh_rl.pdf|archiveurl=https://web.archive.org/web/20150422004457/http://www.ieee.org/documents/moh_rl.pdf|archivedate=2015-04-22 |title=IEEE Medal of Honor Recipients |publisher=IEEE |accessdate=February 27, 2011}} 61. ^{{cite web|author= |url=http://www.dwc.knaw.nl/biografie/pmknaw/?pagetype=authorDetail&aId=PE00002971 |title=C.E. Shannon (1916–2001) |publisher=Royal Netherlands Academy of Arts and Sciences |date= |accessdate=17 July 2015}} 62. ^{{cite web |url=http://www.eduard-rhein-stiftung.de/html/Preistraeger_e.html |title=Award Winners (chronological) |publisher=Eduard Rhein Foundation |accessdate=February 20, 2011 |deadurl=yes |archiveurl=https://web.archive.org/web/20110718233021/http://www.eduard-rhein-stiftung.de/html/Preistraeger_e.html |archivedate=July 18, 2011 |df=mdy-all }} Further reading
External links{{Wikiquote|Claude Elwood Shannon}}
38 : 1916 births|2001 deaths|People of World War II|People of the Cold War|American atheists|20th-century American mathematicians|American computer scientists|American electrical engineers|American electronics engineers|Control theorists|Deaths from Alzheimer's disease|IEEE Medal of Honor recipients|American information theorists|Internet pioneers|Kyoto laureates in Basic Sciences|Massachusetts Institute of Technology alumni|Massachusetts Institute of Technology faculty|Institute for Advanced Study visiting scholars|Members of the Royal Netherlands Academy of Arts and Sciences|National Medal of Science laureates|Pre-computer cryptographers|Scientists at Bell Labs|American systems scientists|Modern cryptographers|University of Michigan alumni|Combinatorial game theorists|Probability theorists|Communication theorists|Unicyclists|Foreign Members of the Royal Society|Computer chess people|Claude Shannon|People from Petoskey, Michigan|National Inventors Hall of Fame inductees|Members of the United States National Academy of Sciences|20th-century American engineers|Jugglers|American geneticists |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。