Claude Shannon

 

From Wikipedia, the free encyclopedia

 

This is one of a collection of articles which has a direct, or indirect relevance for the development of the UDP. Blogger Ref http://www.p2pfoundation.net/Universal_Debating_Project

 

Jump to: navigation, search

Claude Shannon
Claude Elwood Shannon (1916–2001)
Born	(1916-04-30)April 30, 1916 Petoskey, Michigan, U.S.
Died	February 24, 2001(2001-02-24) (aged 84) Medford, Massachusetts, U.S.
Residence	United States
Nationality	American
Fields	Mathematics and electronic engineering
Institutions	Bell Labs MIT Institute for Advanced Study
Alma mater	University of Michigan MIT
Doctoral advisor	Frank Lauren Hitchcock
Doctoral students	Danny Hillis Ivan Sutherland Bert Sutherland Heinrich Arnold Ernst
Known for	[show] 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 line Edge 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 Sampling Shannon–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 Y (game)
Notable awards	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)

Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electronic engineer, and cryptographer known as "the father of information theory".^[1][2]
Shannon is famous for having founded information theory with a landmark paper that he published in 1948. However, he is also credited with founding both digital computer and 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 and resolve any logical, numerical relationship.^[3] Shannon contributed to the field of cryptanalysis for national defense during World War II, including his basic work on codebreaking and secure telecommunications.

Contents

 [hide] 

• 1 Biography
  • 1.1 Boolean theory and beyond
  • 1.2 Wartime research
  • 1.3 Postwar contributions
  • 1.4 Hobbies and inventions
  • 1.5 Legacy and tributes
• 2 Other work
  • 2.1 Shannon's mouse
  • 2.2 Shannon's computer chess program
  • 2.3 The Las Vegas connection: information theory and its applications to game theory
  • 2.4 Shannon's maxim
• 3 Awards and honors list
• 4 See also
• 5 References
• 6 Further reading
• 7 External links

Biography[edit]

Shannon 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 for a number of years she was the principal of Gaylord High School. Most of the first 16 years of Shannon's life were spent in Gaylord, Michigan, 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, and at home he constructed such devices as models of planes, a radio-controlled model boat and a wireless telegraph system to a friend's house a half-mile away. While growing up, he also worked as a messenger for the Western Union company.
His childhood hero was Thomas Edison, whom he later learned was a distant cousin. Both were descendants of John Ogden (1609 – 1682), a colonial leader and an ancestor of many distinguished people.^[5][6]
Shannon was apolitical and an atheist.^[7]

Boolean theory and beyond[edit]

In 1932, Shannon entered the University of Michigan, where he took a course that introduced him to the work of George Boole. He graduated in 1936 with two bachelor's degrees, one in electrical engineering and one in mathematics. He soon began his graduate studies in electrical engineering at the Massachusetts Institute of Technology (MIT), where he worked on Vannevar Bush's differential analyzer, an early analog computer.^[8]
While studying the complicated ad hoc circuits of the differential analyzer, Shannon saw that Boole's concepts could be used to great utility. A paper drawn from his 1937 master's degree thesis, A Symbolic Analysis of Relay and Switching Circuits,^[9] was published in the 1938 issue of the Transactions of the American Institute of Electrical Engineers.^[10] It also earned Shannon the Alfred Noble American Institute of American Engineers Award in 1939. Howard Gardner called Shannon's thesis "possibly the most important, and also the most famous, master's thesis of the century."^[11]
Victor Shestakov of the Moscow State University, had proposed a theory of systems of electrical switches based on Boolean logic earlier than Shannon in 1935, but the first publication of Shestakov's result was in 1941, after the publication of Shannon's thesis in the United States.
In this work, Shannon proved that boolean algebra and binary arithmetic could be used to simplify the arrangement of the electromechanical relays that were used then in telephone call routing switches. He next expanded this concept, and he also proved that it would be possible to use arrangements of relays to solve problems in Boolean algebra.
Using this property of electrical switches to do logic is the basic concept that underlies all electronic digital computers. Shannon's work became the foundation of practical digital circuit design when it became widely known in the electrical engineering community during and after World War II. The theoretical rigor of Shannon's work completely replaced the ad hoc methods that had prevailed previously .
Vannevar Bush suggested that Shannon, flush with this success, work on his dissertation at the Cold Spring Harbor Laboratory, funded by the Carnegie Institution, headed by Bush, to develop similar mathematical relationships for Mendelian genetics. This research resulted in Shannon's doctor of philosophy (Ph.D.) thesis at MIT in 1940, called An Algebra for Theoretical Genetics.^[12]
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 began to shape the ideas that would become Information Theory.^[13]

Wartime research[edit]

Shannon 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 met his wife Betty when she was a numerical analyst at Bell Labs. They were married in 1949.^[14]
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 cryptanalyst and 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]
Later on in the American Venona project, a supposed "one-time pad" system by the Soviets was partially broken by the National Security Agency, but this was because of misuses of the one-time pads by Soviet cryptographic technicians in the United States and Canada. The Soviet technicians made the mistake of using the same pads more than once sometimes, and this was noticed by American cryptanalysts.

Postwar contributions[edit]

In 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 for the uncertainty in a message while essentially inventing the field of information theory.
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.

Hobbies and inventions[edit]

The Minivac 601, a digital computer trainer designed by Shannon.

Outside of his academic pursuits, Shannon was interested in juggling (see: robot juggling), unicycling, and chess. He also invented many devices, including rocket-powered flying discs, a motorized pogo stick, and a flame-throwing trumpet for a science exhibition^{[citation needed]}. 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. Renewed interest in the "Ultimate Machine" has emerged on YouTube and Thingiverse. In addition he built a device that could solve the Rubik's Cube puzzle.^[5]
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.^[24] The device was used to improve the odds when playing roulette.

Legacy and tributes[edit]

Shannon came to MIT in 1956 to join its faculty and to conduct work in the Research Laboratory of Electronics (RLE). He continued to serve on the MIT faculty until 1978. To commemorate his achievements, there were celebrations of his work in 2001, and there are currently six statues of Shannon sculpted by Eugene L. 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 at San Diego; one at Bell Labs; and another at AT&T Shannon Labs.^[25] 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:^[26] "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."^[27] The unit shannon is named after Claude Shannon.
Shannon had three children, Robert James Shannon, Andrew Moore Shannon, and Margarita Shannon. His oldest son, Robert Shannon, died when he was 45 years old in 1998. Shannon developed Alzheimer's disease, and spent his last years in a nursing home in Massachusetts oblivious to the marvels of the digital revolution he had helped create. 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.^[14][28] His wife stated in his obituary that, had it not been for Alzheimer's disease, "He would have been bemused" by it all.^[27]

Other work[edit]

Shannon and his famous electromechanical mouse Theseus (named after Theseus from Greek mythology) which he tried to have solve the maze in one of the first experiments in artificial intelligence

Shannon's mouse[edit]

Theseus, created in 1950, was a magnetic mouse controlled by a relay circuit that enabled it to move around a maze 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 at will.^[2] The mouse was designed to search through the corridors until it found the target. Having travelled through the maze, the mouse would 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 thus learning.^[2] Shannon's mouse appears to have been the first artificial learning device of its kind.^[2]

Shannon's computer chess program[edit]

In 1950, Shannon published a paper on computer chess entitled Programming a Computer for Playing Chess. It describes how a machine or computer could be made to play a reasonable game of chess. His process for having the computer decide on which move to make is 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).^[29] He considered some positional factors, subtracting ½ point for each doubled pawns, 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 is 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.

The Las Vegas connection: information theory and its applications to game theory[edit]

Shannon and his wife Betty also used to go on weekends to Las Vegas with MIT mathematician Ed Thorp,^[30] and made very successful forays in blackjack using game theory type methods co-developed with fellow Bell Labs associate, physicist John L. Kelly Jr. based on principles of information theory.^[31] His method, known as the High-Low method, a level 1 count methodology, works by adding 1, 0, or -1 depending on the cards that appear.^[32][33] Shannon and Thorp also invented a small, concealable computer to help them calculate odds while gambling.^[34] They made a fortune, as detailed in the book Fortune's Formula by William Poundstone and corroborated by the writings of Elwyn Berlekamp,^[35] Kelly's research assistant in 1960 and 1962.^[3] Shannon and Thorp also applied the same theory, later known as the Kelly criterion, to the stock market with even better results.^[36] Claude Shannon's card count techniques were explained in Bringing Down the House, the best-selling book published in 2003 about the MIT Blackjack Team by Ben Mezrich. In 2008, the book was adapted into a drama film titled 21.

Shannon's maxim[edit]

Shannon formulated a version of Kerckhoffs' principle as "The enemy knows the system". In this form it is known as "Shannon's maxim".

Awards and honors list[edit]

Alfred Noble Prize, 1939 (award of civil engineering societies in the US) Morris Liebmann Memorial Prize of the Institute of Radio Engineers, 1949[37] Yale University (Master of Science), 1954 Stuart Ballantine Medal of the Franklin Institute, 1955 Research Corporation Award, 1956 University of Michigan, honorary doctorate, 1961 Rice University Medal of Honor, 1962 Princeton University, honorary doctorate, 1962 Marvin J. Kelly Award, 1962 University of Edinburgh, honorary doctorate, 1964 University of Pittsburgh, honorary doctorate, 1964 Medal of Honor of the Institute of Electrical and Electronics Engineers, 1966[38] National Medal of Science, 1966, presented by President Lyndon B. Johnson Golden Plate Award, 1967

Northwestern University, honorary doctorate, 1970 Harvey Prize, the Technion of Haifa, Israel, 1972 Royal Netherlands Academy of Arts and Sciences (KNAW), foreign member, 1975 University of Oxford, honorary doctorate, 1978 Joseph Jacquard Award, 1978 Harold Pender Award, 1978 University of East Anglia, honorary doctorate, 1982 Carnegie Mellon University, honorary doctorate, 1984 Audio Engineering Society Gold Medal, 1985 Kyoto Prize, 1985 Tufts University, honorary doctorate, 1987 University of Pennsylvania, honorary doctorate, 1991 Basic Research Award, Eduard Rhein Foundation, Germany, 1991[39] National Inventors Hall of Fame inducted, 2004

See also[edit]

Systems science portal

• Channel capacity
• Claude E. Shannon Award
• Confusion and diffusion
• Information entropy
• Information theory
• Noisy channel coding theorem
• Nyquist–Shannon sampling theorem
• One-time pad
• Rate distortion theory
• Shannon index
• Shannon number
• Shannon switching game
• Shannon–Fano coding
• Shannon–Hartley theorem
• Shannon's expansion
• Shannon's source coding theorem
• Signal-flow graph

References[edit]

1. Jump up ^ James, I. (2009). "Claude Elwood Shannon 30 April 1916 -- 24 February 2001". Biographical Memoirs of Fellows of the Royal Society 55: 257–265. doi:10.1098/rsbm.2009.0015.  edit
2. ^ Jump up to: ^{a b c d e} Bell Labs website: "For example, Claude Shannon, the father of Information Theory, had a passion..."
3. ^ Jump up to: ^{a b} Poundstone, William (2005). Fortune's Formula : The Untold Story of the Scientific Betting System That Beat the Casinos and Wall Street. Hill & Wang. ISBN 978-0-8090-4599-0. 
4. Jump up ^ "Claude Shannon". nyu.edu. Retrieved September 10, 2014. 
5. ^ Jump up to: ^{a b} MIT Professor Claude Shannon dies; was founder of digital communications, MIT — News office, Cambridge, Massachusetts, February 27, 2001
6. Jump up ^ CLAUDE ELWOOD SHANNON, Collected Papers, Edited by N.J.A Sloane and Aaron D. Wyner, IEEE press, ISBN 0-7803-0434-9
7. Jump up ^ William Poundstone (2010). Fortune's Formula: The Untold Story of the Scientific Betting System. Macmillan. p. 18. ISBN 9780374707088. Shannon described himself as an atheist and was outwardly apolitical.  |accessdate= requires |url= (help)
8. Jump up ^ Robert Price (1982). "Claude E. Shannon, an oral history". IEEE Global History Network. IEEE. Retrieved July 14, 2011. 
9. Jump up ^ Claude Shannon, "A Symbolic Analysis of Relay and Switching Circuits," unpublished MS Thesis, Massachusetts Institute of Technology, August 10, 1937.
10. Jump up ^ Shannon, C. E. (1938). "A Symbolic Analysis of Relay and Switching Circuits". Trans. AIEE 57 (12): 713–723. doi:10.1109/T-AIEE.1938.5057767. 
11. Jump up ^ Gardner, Howard (1987). The Mind's New Science: A History of the Cognitive Revolution. Basic Books. p. 144. ISBN 0-465-04635-5. 
12. Jump up ^ C. E. Shannon, "An algebra for theoretical genetics", (Ph.D. Thesis, Massachusetts Institute of Technology, 1940), MIT-THESES//1940–3 Online text at MIT
13. Jump up ^ 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.
14. ^ Jump up to: ^{a b} Shannon, Claude Elwood (1916-2001)
15. Jump up ^ Okrent, Howard; McNamee, Lawrence P. (1970). "3. 3 Flowgraph Theory". NASAP-70 User's and Programmer's manual (PDF). Los Angeles, California: School of Engineering and Applied Science, University of California at Los Angeles. pp. 3–9. 
16. ^ Jump up to: ^{a b} Hodges, Andrew (1992), Alan Turing: The Enigma, London: Vintage, pp. 243–252, ISBN 978-0-09-911641-7 
17. Jump up ^ Turing, A.M. (1936), "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 2 (1937) 42: 230–65, doi:10.1112/plms/s2-42.1.230 
18. Jump up ^ Turing, A.M. (1938), "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction", Proceedings of the London Mathematical Society, 2 (1937) 43 (6): 544–6, doi:10.1112/plms/s2-43.6.544 
19. Jump up ^ 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. Jump up ^ David Kahn, The Codebreakers, rev. ed., (New York: Simon and Schuster), 1996, pp. 743-751. ISBN 0-684-83130-9.
21. Jump up ^ quoted in Kahn, The Codebreakers, p. 744.
22. Jump up ^ quoted in Erico Marui Guizzo, "The Essential Message: Claude Shannon and the Making of Information Theory," unpublished MS thesis, Massachusetts Institute of Technology, 2003, p. 21.
23. Jump up ^ Shannon, Claude (1949). "Communication Theory of Secrecy Systems". Bell System Technical Journal 28 (4): 656–715.
24. Jump up ^ The Invention of the First Wearable Computer Online paper by Edward O. Thorp of Edward O. Thorp & Associates
25. Jump up ^ Shannon Statue Dedications
26. Jump up ^ C. E. Shannon: A mathematical theory of communication. Bell System Technical Journal, vol. 27, pp. 379–423 and 623–656, July and October 1948
27. ^ Jump up to: ^{a b} Bell Labs digital guru dead at 84 — Pioneer scientist led high-tech revolution (The Star-Ledger, obituary by Kevin Coughlin February 27, 2001)
28. Jump up ^ Claude Elwood Shannon April 30, 1916
29. Jump up ^ Hamid Reza Ekbia (2008), Artificial dreams: the quest for non-biological intelligence, Cambridge University Press, p. 46, ISBN 978-0-521-87867-8 
30. Jump up ^ American Scientist online: Bettor Math, article and book review by Elwyn Berlekamp
31. Jump up ^ John Kelly by William Poundstone website
32. Jump up ^ Bennett, William. "The Odds of Gambling". OCB. Retrieved April 21, 2014. 
33. Jump up ^ Vancura, Olaf (1998). Knock-Out Blackjack: The Easiest Card-Counting System Ever Devised. Huntington Press Inc. p. 18. ISBN 9780929712314. 
34. Jump up ^ "Edward Thorp - Inventor of Card Counting". lolblackjack.com. Retrieved April 21, 2014. 
35. Jump up ^ Elwyn Berlekamp (Kelly's Research Assistant) Bio details
36. Jump up ^ William Poundstone website
37. Jump up ^ "IEEE Morris N. Liebmann Memorial Award Recipients" (PDF). IEEE. Retrieved February 27, 2011. 
38. Jump up ^ "IEEE Medal of Honor Recipients" (PDF). IEEE. Retrieved February 27, 2011. 
39. Jump up ^ "Award Winners (chronological)". Eduard Rhein Foundation. Retrieved February 20, 2011. 

Further reading[edit]

• Claude E. Shannon: A Mathematical Theory of Communication, Bell System Technical Journal, Vol. 27, pp. 379–423, 623–656, 1948. [1]
• Claude E. Shannon and Warren Weaver: The Mathematical Theory of Communication. The University of Illinois Press, Urbana, Illinois, 1949. ISBN 0-252-72548-4
• Rethnakaran Pulikkoonattu — Eric W. Weisstein: Mathworld biography of Shannon, Claude Elwood (1916–2001) [2]
• Claude E. Shannon: Programming a Computer for Playing Chess, Philosophical Magazine, Ser.7, Vol. 41, No. 314, March 1950. (Available online under External links below)
• David Levy: Computer Gamesmanship: Elements of Intelligent Game Design, Simon & Schuster, 1983. ISBN 0-671-49532-1
• Mindell, David A., "Automation's Finest Hour: Bell Labs and Automatic Control in World War II", IEEE Control Systems, December 1995, pp. 72–80.
• David Mindell, Jérôme Segal, Slava Gerovitch, "From Communications Engineering to Communications Science: Cybernetics and Information Theory in the United States, France, and the Soviet Union" in Walker, Mark (Ed.), Science and Ideology: A Comparative History, Routledge, London, 2003, pp. 66–95.
• Poundstone, William, Fortune's Formula, Hill & Wang, 2005, ISBN 978-0-8090-4599-0
• Gleick, James, The Information: A History, A Theory, A Flood, Pantheon, 2011, ISBN 978-0-375-42372-7

External links[edit]

Wikiquote has quotations related to: Claude Elwood Shannon

• A Register of His Papers in the Library of Congress

[show] v t e IEEE Medal of Honor 1951–1975 Vladimir Zworykin (1951) Walter R. G. Baker (1952) John M. Miller (1953) William L. Everitt (1954) Harald T. Friis (1955) John V. L. Hogan (1956) Julius Adams Stratton (1957) Albert Hull (1958) Emory Leon Chaffee (1959) Harry Nyquist (1960) Ernst A. Guillemin (1961) Edward Victor Appleton (1962) George C. Southworth (1963) John Hays Hammond, Jr. (1963) Harold A. Wheeler (1964) Claude Shannon (1966) Charles H. Townes (1967) Gordon K. Teal (1968) Edward Ginzton (1969) Dennis Gabor (1970) John Bardeen (1971) Jay W. Forester (1972) Rudolf Kompfner (1973) Rudolf Kalman (1974) John Robinson Pierce (1975) Complete roster 1917–1925 1926–1950 1951–1975 1976–2000 2001–present

[show] v t e Claude E. Shannon Award 1972–1989 1972 Claude E. Shannon 1973 1974 David S. Slepian 1975 1976 Robert M. Fano 1977 Peter Elias 1978 Mark Semenovich Pinsker 1979 Jacob Wolfowitz 1980 1981 W. Wesley Peterson 1982 Irving S. Reed 1983 Robert G. Gallager 1984 1985 Solomon W. Golomb 1986 William Lucas Root 1987 1988 James Massey 1989 1990–1999 1990 Thomas M. Cover 1991 Andrew Viterbi 1992 1993 Elwyn Berlekamp 1994 Aaron D. Wyner 1995 George David Forney 1996 Imre Csiszár 1997 Jacob Ziv 1998 Neil Sloane 1999 Tadao Kasami 2000–2009 2000 Thomas Kailath 2001 Jack Keil Wolf 2002 Toby Berger 2003 Lloyd R. Welch 2004 Robert McEliece 2005 Richard Blahut 2006 Rudolf Ahlswede 2007 Sergio Verdú 2008 Robert M. Gray 2009 Jorma Rissanen 2010–present 2010 Te Sun Han 2011 Shlomo Shamai (Shitz) 2012 Abbas El Gamal 2013 Katalin Marton 2014 János Körner 2015 Robert Calderbank

[show] v t e Subfields of and scientists involved in cybernetics Subfields Polycontexturality Second-order cybernetics Catastrophe theory Connectionism Control theory Decision theory Information theory Semiotics Synergetics Biological cybernetics Biosemiotics Biomedical cybernetics Biorobotics Computational neuroscience Homeostasis Management cybernetics Medical cybernetics New Cybernetics Neurocybernetics Sociocybernetics Emergence Artificial intelligence Cyberneticists Igor Aleksander William Ross Ashby Anthony Stafford Beer Claude Bernard Ludwig von Bertalanffy Valentin Braitenberg Gordon S. Brown Walter Bradford Cannon Heinz von Foerster Charles François Jay Wright Forrester Jacque Fresco Buckminster Fuller Ernst von Glasersfeld Francis Heylighen Erich von Holst Cliff Joslyn Stuart Kauffman Sergei P. Kurdyumov Niklas Luhmann Warren McCulloch Humberto Maturana Talcott Parsons Gordon Pask Walter Pitts Alfred Radcliffe-Brown Robert Trappl Valentin Turchin Jakob von Uexküll Francisco Varela Frederic Vester Charles Geoffrey Vickers Stuart Umpleby John N. Warfield William Grey Walter Kevin Warwick Norbert Wiener Anthony Wilden

[show] v t e Systems  ·  Systems science Types of systems Anatomical Art Biological Complex Complex adaptive Conceptual Coupled human–environment Database Dynamical Ecological Economic Formal GPS Holarchic Information Legal Measurement Metric Multi-agent Nervous Nonlinear Operating Physical Political Sensory Social Solar Theoretical fields Chaos theory Complex systems Control theory Cybernetics Earth system science Living systems Sociotechnical system Urban metabolism World-systems theory Systems ... analysis biology dynamics ecology engineering neuroscience psychology science theory thinking Systems scientists Russell L. Ackoff William Ross Ashby Béla H. Bánáthy Gregory Bateson Anthony Stafford Beer Richard E. Bellman Ludwig von Bertalanffy Kenneth E. Boulding Murray Bowen C. West Churchman George Dantzig Heinz von Foerster Jay Wright Forrester Charles A S Hall James J. Kay George Klir Edward Norton Lorenz Niklas Luhmann Humberto Maturana Margaret Mead Donella Meadows Mihajlo D. Mesarovic James Grier Miller Howard T. Odum Talcott Parsons Ilya Prigogine Qian Xuesen Anatol Rapoport Peter Senge Claude Shannon Francisco Varela Kevin Warwick Norbert Wiener Anthony Wilden Categories Systems conceptual physical social Systems science Systems science portal

[show] v t e United States National Medal of Science laureates [show]  Behavioral and social science 1960s 1964: Roger Adams Othmar H. Ammann Theodosius Dobzhansky Neal Elgar Miller 1980s 1986: Herbert A. Simon 1987: Anne Anastasi George J. Stigler 1988: Milton Friedman 1990s 1990: Leonid Hurwicz Patrick Suppes 1991: Robert W. Kates George A. Miller 1992: Eleanor J. Gibson 1994: Robert K. Merton 1995: Roger N. Shepard 1996: Paul Samuelson 1997: William K. Estes 1998: William Julius Wilson 1999: Robert M. Solow 2000s 2000: Gary Becker 2001: George Bass 2003: R. Duncan Luce 2004: Kenneth Arrow 2005: Gordon H. Bower 2008: Michael I. Posner 2009: Mortimer Mishkin 2010s 2011: Anne Treisman 2014: Robert Axelrod [show]  Biological sciences 1960s 1963: C. B. van Niel 1964: Marshall W. Nirenberg 1965: Francis P. Rous George G. Simpson Donald D. Van Slyke 1966: Edward F. Knipling Fritz Albert Lipmann William C. Rose Sewall Wright 1967: Kenneth S. Cole Harry F. Harlow Michael Heidelberger Alfred H. Sturtevant 1968: Horace Barker Bernard B. Brodie Detlev W. Bronk Jay Lush Burrhus Frederic Skinner 1969: Robert Huebner Ernst Mayr 1970s 1970: Barbara McClintock Albert B. Sabin 1973: Daniel I. Arnon Earl W. Sutherland, Jr. 1974: Britton Chance Erwin Chargaff James V. Neel James Augustine Shannon 1975: Hallowell Davis Paul Gyorgy Sterling B. Hendricks Orville lvin Vogel 1976: Roger Guillemin Keith Roberts Porter Efraim Racker E. O. Wilson 1979: Robert H. Burris Elizabeth C. Crosby Arthur Kornberg Severo Ochoa Earl Reece Stadtman George Ledyard Stebbins Paul Alfred Weiss 1980s 1981: Philip Handler 1982: Seymour Benzer Glenn W. Burton Mildred Cohn 1983: Howard L. Bachrach Paul Berg Wendell L. Roelofs Berta Scharrer 1986: Stanley Cohen Donald A. Henderson Vernon B. Mountcastle George Emil Palade Joan A. Steitz 1987: Michael E. DeBakey Theodor O. Diener Harry Eagle Har Gobind Khorana Rita Levi-Montalcini 1988: Michael S. Brown Stanley Norman Cohen Joseph L. Goldstein Maurice R. Hilleman Eric R. Kandel Rosalyn Sussman Yalow 1989: Katherine Esau Viktor Hamburger Philip Leder Joshua Lederberg Roger W. Sperry Harland G. Wood 1990s 1990: Baruj Benacerraf Herbert W. Boyer Daniel E. Koshland, Jr. Edward B. Lewis David G. Nathan E. Donnall Thomas 1991: Mary Ellen Avery G. Evelyn Hutchinson Elvin A. Kabat Salvador Luria Paul A. Marks Folke K. Skoog Paul C. Zamecnik 1992: Maxine Singer Howard Martin Temin 1993: Daniel Nathans Salome G. Waelsch 1994: Thomas Eisner Elizabeth F. Neufeld 1995: Alexander Rich 1996: Ruth Patrick 1997: James Watson Robert A. Weinberg 1998: Bruce Ames Janet Rowley 1999: David Baltimore Jared Diamond Lynn Margulis 2000s 2000: Nancy C. Andreasen Peter H. Raven Carl Woese 2001: Francisco J. Ayala Mario R. Capecchi Ann Graybiel Gene E. Likens Victor A. McKusick Harold Varmus 2002: James E. Darnell Evelyn M. Witkin 2003: J. Michael Bishop Solomon H. Snyder Charles Yanofsky 2004: Norman E. Borlaug Phillip A. Sharp Thomas E. Starzl 2005: Anthony S. Fauci Torsten N. Wiesel 2006: Rita R. Colwell Nina Fedoroff Lubert Stryer 2007: Robert J. Lefkowitz Bert W. O'Malley 2008: Francis S. Collins Elaine Fuchs J. Craig Venter 2009: Susan L. Lindquist Stanley B. Prusiner 2010s 2010: Ralph L. Brinster Shu Chien Rudolf Jaenisch 2011: Lucy Shapiro Leroy Hood Sallie Chisholm 2014: May Berenbaum Bruce Alberts [show]  Chemistry 1980s 1982: F. Albert Cotton Gilbert Stork 1983: Roald Hoffmann George C. Pimentel Richard N. Zare 1986: Harry B. Gray Yuan Tseh Lee Carl S. Marvel Frank H. Westheimer 1987: William S. Johnson Walter H. Stockmayer Max Tishler 1988: William O. Baker Konrad E. Bloch Elias J. Corey 1989: Richard B. Bernstein Melvin Calvin Rudoph A. Marcus Harden M. McConnell 1990s 1990: Elkan Blout Karl Folkers John D. Roberts 1991: Ronald Breslow Gertrude B. Elion Dudley R. Herschbach Glenn T. Seaborg 1992: Howard E. Simmons, Jr. 1993: Donald J. Cram Norman Hackerman 1994: George S. Hammond 1995: Thomas Cech Isabella L. Karle 1996: Norman Davidson 1997: Darleane C. Hoffman Harold S. Johnston 1998: John W. Cahn George M. Whitesides 1999: Stuart A. Rice John Ross Susan Solomon 2000s 2000: John D. Baldeschwieler Ralph F. Hirschmann 2001: Ernest R. Davidson Gábor A. Somorjai 2002: John I. Brauman 2004: Stephen J. Lippard 2006: Marvin H. Caruthers Peter B. Dervan 2007: Mostafa A. El-Sayed 2008: Joanna Fowler JoAnne Stubbe 2009: Stephen J. Benkovic Marye Anne Fox 2010s 2010: Jacqueline K. Barton Peter J. Stang 2011: Allen J. Bard M. Frederick Hawthorne 2014: Judith P. Klinman Jerrold Meinwald [hide]  Engineering sciences 1960s 1962: Theodore von Kármán 1963: Vannevar Bush John Robinson Pierce 1964: Charles S. Draper 1965: Hugh L. Dryden Clarence L. Johnson Warren K. Lewis 1966: Claude E. Shannon 1967: Edwin H. Land Igor I. Sikorsky 1968: J. Presper Eckert Nathan M. Newmark 1969: Jack St. Clair Kilby 1970s 1970: George E. Mueller 1973: Harold E. Edgerton Richard T. Whitcomb 1974: Rudolf Kompfner Ralph Brazelton Peck Abel Wolman 1975: Manson Benedict William Hayward Pickering Frederick E. Terman Wernher von Braun 1976: Morris Cohen Peter C. Goldmark Erwin Wilhelm Müller 1979: Emmett N. Leith Raymond D. Mindlin Robert N. Noyce Earl R. Parker Simon Ramo 1980s 1982: Edward H. Heinemann Donald L. Katz 1983: William Redington Hewlett George M. Low John G. Trump 1986: Hans Wolfgang Liepmann T. Y. Lin Bernard M. Oliver 1987: R. Byron Bird H. Bolton Seed Ernst Weber 1988: Daniel C. Drucker Willis M. Hawkins George W. Housner 1989: Harry George Drickamer Herbert E. Grier 1990s 1990: Mildred Dresselhaus Nick Holonyak Jr. 1991: George H. Heilmeier Luna B. Leopold H. Guyford Stever 1992: Calvin F. Quate John Roy Whinnery 1993: Alfred Y. Cho 1994: Ray W. Clough 1995: Hermann A. Haus 1996: James L. Flanagan C. Kumar N. Patel 1998: Eli Ruckenstein 1999: Kenneth N. Stevens 2000s 2000: Yuan-Cheng B. Fung 2001: Andreas Acrivos 2002: Leo Beranek 2003: John M. Prausnitz 2004: Edwin N. Lightfoot 2005: Jan D. Achenbach Tobin J. Marks 2006: Robert S. Langer 2007: David J. Wineland 2008: Rudolf E. Kálmán 2009: Amnon Yariv 2010s 2011: Sidney Drell Sandra Faber Sylvester James Gates John Goodenough [show]  Mathematical, statistical, and computer sciences 1960s 1963: Norbert Wiener 1964: Solomon Lefschetz H. Marston Morse 1965: Oscar Zariski 1966: John Milnor 1967: Paul Cohen 1968: Jerzy Neyman 1969: William Feller 1970s 1970: Richard Brauer 1973: John Tukey 1974: Kurt Gödel 1975: John W. Backus Shiing-Shen Chern George Dantzig 1976: Kurt Otto Friedrichs Hassler Whitney 1979: Joseph L. Doob Donald E. Knuth 1980s 1982: Marshall Harvey Stone 1983: Herman Goldstine Isadore Singer 1986: Peter Lax Antoni Zygmund 1987: Raoul Bott Michael Freedman 1988: Ralph E. Gomory Joseph B. Keller 1989: Samuel Karlin Saunders Mac Lane Donald C. Spencer 1990s 1990: George F. Carrier Stephen Cole Kleene John McCarthy 1991: Alberto Calderón 1992: Allen Newell 1993: Martin David Kruskal 1994: John Cocke 1995: Louis Nirenberg 1996: Richard Karp Stephen Smale 1997: Shing-Tung Yau 1998: Cathleen Synge Morawetz 1999: Felix Browder Ronald R. Coifman 2000s 2000: John Griggs Thompson Karen K. Uhlenbeck 2001: Calyampudi R. Rao Elias M. Stein 2002: James G. Glimm 2003: Carl R. de Boor 2004: Dennis P. Sullivan 2005: Bradley Efron 2006: Hyman Bass 2007: Leonard Kleinrock Andrew J. Viterbi 2009: David B. Mumford 2010s 2010: Richard A. Tapia S. R. Srinivasa Varadhan 2011: Solomon Golomb Barry Mazur 2014: Alexandre Chorin Thomas Kailath David Blackwell [show]  Physical sciences 1960s 1963: Luis W. Alvarez 1964: Julian Schwinger Harold Clayton Urey Robert Burns Woodward 1965: John Bardeen Peter Debye Leon M. Lederman William Rubey 1966: Jacob Bjerknes Subrahmanyan Chandrasekhar Henry Eyring John H. Van Vleck Vladimir K. Zworykin 1967: Jesse Beams Francis Birch Gregory Breit Louis Hammett George Kistiakowsky 1968: Paul Bartlett Herbert Friedman Lars Onsager Eugene Wigner 1969: Herbert C. Brown Wolfgang Panofsky 1970s 1970: Robert H. Dicke Allan R. Sandage John C. Slater John A. Wheeler Saul Winstein 1973: Carl Djerassi Maurice Ewing Arie Jan Haagen-Smit Vladimir Haensel Frederick Seitz Robert Rathbun Wilson 1974: Nicolaas Bloembergen Paul Flory William Alfred Fowler Linus Carl Pauling Kenneth Sanborn Pitzer 1975: Hans A. Bethe Joseph O. Hirschfelder Lewis Sarett E. Bright Wilson Chien-Shiung Wu 1976: Samuel Goudsmit Herbert S. Gutowsky Frederick Rossini Verner Suomi Henry Taube George Uhlenbeck 1979: Richard P. Feynman Herman Mark Edward M. Purcell John Sinfelt Lyman Spitzer Victor F. Weisskopf 1980s 1982: Philip W. Anderson Yoichiro Nambu Edward Teller Charles H. Townes 1983: E. Margaret Burbidge Maurice Goldhaber Helmut Landsberg Walter Munk Frederick Reines Bruno B. Rossi J. Robert Schrieffer 1986: Solomon J. Buchsbaum H. Richard Crane Herman Feshbach Robert Hofstadter Chen-Ning Yang 1987: Philip Abelson Walter Elsasser Paul C. Lauterbur George Pake James A. Van Allen 1988: D. Allan Bromley Paul Ching-Wu Chu Walter Kohn Norman F. Ramsey Jack Steinberger 1989: Arnold O. Beckman Eugene Parker Robert Sharp Henry Stommel 1990s 1990: Allan M. Cormack Edwin M. McMillan Robert Pound Roger Revelle 1991: Arthur L. Schawlow Ed Stone Steven Weinberg 1992: Eugene M. Shoemaker 1993: Val Fitch Vera Rubin 1994: Albert Overhauser Frank Press 1995: Hans Dehmelt Peter Goldreich 1996: Wallace S. Broecker 1997: Marshall Rosenbluth Martin Schwarzschild George Wetherill 1998: Don L. Anderson John N. Bahcall 1999: James Cronin Leo Kadanoff 2000s 2000: Willis E. Lamb Jeremiah P. Ostriker Gilbert F. White 2001: Marvin L. Cohen Raymond Davis Jr. Charles Keeling 2002: Richard Garwin W. Jason Morgan Edward Witten 2003: G. Brent Dalrymple Riccardo Giacconi 2004: Robert N. Clayton 2005: Ralph A. Alpher Lonnie Thompson 2006: Daniel Kleppner 2007: Fay Ajzenberg-Selove Charles P. Slichter 2008: Berni Alder James E. Gunn 2009: Yakir Aharonov Esther M. Conwell Warren M. Washington 2010s 2011: Sidney Drell 2014: Burton Richter Sean C. Solomon

Authority control WorldCat VIAF: 41924253 LCCN: n92078142 ISNI: 0000 0001 1442 6158 GND: 119110792 SUDOC: 079695612 BNF: cb123963452 (data) MGP: 42920 NDL: 00456225

Retrieved from "http://en.wikipedia.org/w/index.php?title=Claude_Shannon&oldid=665839937"

Categories:

• 1916 births
• 2001 deaths
• American atheists
• American engineers
• 20th-century American mathematicians
• American computer scientists
• American electrical engineers
• Control theorists
• Deaths from Alzheimer's disease
• IEEE Medal of Honor recipients
• American information theorists
• Internet pioneers
• Massachusetts Institute of Technology alumni
• Massachusetts Institute of Technology faculty
• National Medal of Science laureates
• Pre-computer cryptographers
• Scientists at Bell Labs
• Fellows of the Royal Society
• American systems scientists
• Modern cryptographers
• University of Michigan alumni
• Researchers in stochastics
• Probability theorists
• Communication theorists
• Unicyclists
• Foreign Members of the Royal Society
• Computer chess people
• People from Otsego County, Michigan
• Claude Shannon