Claude Shannon | |
---|---|
![]() Shannon c. 1950s | |
Born | Claude Elwood Shannon April 30, 1916 Petoskey, Michigan, U.S. |
Died | February 24, 2001 Medford, Massachusetts, U.S. | (aged 84)
Education | University of Michigan (BS, BSE) Massachusetts Institute of Technology (MS, PhD) |
Known for | |
Spouses |
|
Awards |
|
Scientific career | |
Fields | Mathematics, computer science, electronic engineering, artificial intelligence |
Institutions |
|
Theses | |
Doctoral advisor | Frank Lauren Hitchcock |
Doctoral students |
Claude Elwood Shannon (April 30, 1916 – February 24, 2001) was an American mathematician, electrical engineer, computer scientist, cryptographer and inventor, known as the "father of information theory" and credited with laying the foundations of the Information Age.[1][2][3] Shannon was the first to describe the use of Boolean algebra that are essential to all digital electronic circuits, and was one of the founding fathers of artificial intelligence.[4][5][6] Roboticist Rodney Brooks declared that Shannon was the 20th century engineer who contributed the most to 21st century technologies,[7] and mathematician Solomon W. Golomb described his intellectual achievement as "one of the greatest of the twentieth century".[8]
At the University of Michigan, Shannon dual degreed, graduating with a Bachelor of Science in both electrical engineering and mathematics in 1936. A 21-year-old master's degree student in electrical engineering at MIT, his thesis "A Symbolic Analysis of Relay and Switching Circuits" demonstrated that electrical applications of Boolean algebra could construct any logical numerical relationship,[9] thereby establishing the theory behind digital computing and digital circuits.[10] The thesis has been claimed to be the most important master's thesis of all time,[9] having been called the "birth certificate of the digital revolution",[11] and winning the 1939 Alfred Noble Prize.[12] He graduated from MIT in 1940 with a PhD in mathematics;[13] his thesis focusing on genetics contained important results, while initially going unpublished.[14]
Shannon contributed to the field of cryptanalysis for national defense of the United States during World War II, including his fundamental work on codebreaking and secure telecommunications, writing a paper which is considered one of the foundational pieces of modern cryptography,[15] with his work described as "a turning point, and marked the closure of classical cryptography and the beginning of modern cryptography".[16] The work of Shannon was foundational for symmetric-key cryptography, including the work of Horst Feistel, the Data Encryption Standard (DES), and the Advanced Encryption Standard (AES).[16] As a result, Shannon has been called the "founding father of modern cryptography".[17]
His 1948 paper "A Mathematical Theory of Communication" laid the foundations for the field of information theory,[18][13] referred to as a "blueprint for the digital era" by electrical engineer Robert G. Gallager[19] and "the Magna Carta of the Information Age" by Scientific American.[20][21] Golomb compared Shannon's influence on the digital age to that which "the inventor of the alphabet has had on literature".[18] Advancements across multiple scientific disciplines utilized Shannon's theory—including the invention of the compact disc, the development of the Internet, the commercialization of mobile telephony, and the understanding of black holes.[22][23] He also formally introduced the term "bit",[24][2] and was a co-inventor of both pulse-code modulation and the first wearable computer.
Shannon made numerous contributions to the field of artificial intelligence,[4] including co-organizing the 1956 Dartmouth workshop considered to be the discipline's founding event,[25][26] and papers on the programming of chess computers.[27][28] His Theseus machine was the first electrical device to learn by trial and error, being one of the first examples of artificial intelligence.[7][29]
:11
was invoked but never defined (see the help page).
MIT
was invoked but never defined (see the help page).