Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
List of pioneers in computer science
open-in-new
<h2 id="pioneers">Pioneers</h2> <table><tbody><tr><th>Achievementdate</th><th>Person</th><th>Achievement</th></tr><tr><td>1977</td><td><a href="/facts/Leonard_Adleman/uSGnztdj">Adleman, Leonard</a></td><td><a href="/facts/RSA_(algorithm)/XTzyfHuq">RSA algorithm</a> and making <a href="/facts/Public-key_cryptography/gowoFTxS">public-key cryptography</a> useful in practice.</td></tr><tr><td>1944</td><td><a href="/facts/Howard_Aiken/EXT7VMAC">Aiken, Howard</a></td><td>Conceived and co-designed the <a href="/facts/Harvard_Mark_I/0d0yAVjb">Harvard Mark I</a>.</td></tr><tr><td>830~</td><td><a href="/facts/Muhammad_ibn_Musa_al-Khwarizmi/24KdxyEQ">Al-Khwarizmi</a></td><td>The term <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> is derived from the <a href="/facts/Algorism/btA0FVxc">algorism</a>, the technique of performing <a href="/facts/Arithmetic/hvHwkbMV">arithmetic</a> with <a href="/facts/Hindu%25E2%2580%2593Arabic_numeral_system/z73KvotW">Hindu–Arabic numerals</a> popularised by al-Khwarizmi in his book <i>On the Calculation with Hindu Numerals</i>.<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a><a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a></td></tr><tr><td>1970, 1989</td><td><a href="/facts/Frances_E._Allen/GtoQRgdB">Allen, Frances E.</a></td><td>Developed <a href="/facts/Bit_vector/PAfzTEHB">bit vector</a> notation and program <a href="/facts/Control-flow_graph/BLsvNzcP">control-flow graphs</a>; first female <a href="/facts/IBM/QszA7nwd">IBM</a> Fellow (1989); first female recipient of the ACM's <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> (2006).</td></tr><tr><td>1954, 1964, 1967</td><td><a href="/facts/Gene_Amdahl/u83Qhvdw">Amdahl, Gene</a></td><td>Pioneer of <a href="/facts/Mainframe_computer/nrBR6rWa">mainframe computing</a>; designed <a href="/facts/IBM_704/bKkwXYb3">IBM 704</a>; chief architect of <a href="/facts/IBM_System%2f360/7znvpy4K">IBM System/360</a>.<a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a><a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> Formulated <a href="/facts/Amdahl%2527s_law/ChdYzFx3">Amdahl's law</a>; also worked on <a href="/facts/IBM_709/N8RAWUTP">IBM 709</a> and <a href="/facts/IBM_7030_Stretch/V8SdUp00">IBM 7030 Stretch</a>.<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a></td></tr><tr><td>1939</td><td><a href="/facts/John_Vincent_Atanasoff/HTXjwa4Y">Atanasoff, John</a></td><td>Built the first electronic digital computer, the <a href="/facts/Atanasoff%25E2%2580%2593Berry_Computer/JJg9kmv3">Atanasoff–Berry Computer</a>, though it was neither programmable nor <a href="/facts/Turing-completeness/73goop44">Turing-complete</a>.</td></tr><tr><td>1822, 1837</td><td><a href="/facts/Charles_Babbage/T3jklQcd">Babbage, Charles</a></td><td>Originated the concept of a programmable general-purpose computer; designed the <a href="/facts/Analytical_Engine/Ts9xduLI">Analytical Engine</a> and built a prototype for a less powerful <a href="/facts/Difference_engine/9extR8lB">mechanical calculator</a>.</td></tr><tr><td>1973</td><td><a href="/facts/Charles_Bachman/gqbceeqh">Bachman, Charles</a></td><td>Outstanding contributions to <a href="/facts/Database/VYcpkevb">database</a> technology.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a></td></tr><tr><td>1954, 1963</td><td><a href="/facts/John_Backus/pqELHDh6">Backus, John</a></td><td>Led the team that created <a href="/facts/FORTRAN/m1KqjcMU">FORTRAN</a> (<i>For</i>mula <i>Tran</i>slation), the first practical high-level programming language, and formulated the <a href="/facts/Backus%25E2%2580%2593Naur_form/xbMXDntc">Backus–Naur form</a> that described the formal language <a href="/facts/Syntax/6PxSV98p">syntax</a>.</td></tr><tr><td>850~</td><td><a href="/facts/Ban%25C5%25AB_M%25C5%25ABs%25C4%2581/Taj5kewc">Banū Mūsā</a></td><td>Three brothers who wrote the <i><a href="/facts/Book_of_Ingenious_Devices/TQ9LmEgl">Book of Ingenious Devices</a></i>, describing what appears to be the first <a href="/facts/Program_(machine)/2e2GCRFA">programmable</a> machine, an <a href="/facts/Music_sequencer/VhLzSPhr">automatic</a> <a href="/facts/Flute/bByjt2vu">flute</a> player.<a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a></td></tr><tr><td>1960–1964</td><td><a href="/facts/Paul_Baran/uVUe5PPB">Baran, Paul</a></td><td>One of two independent inventors of the concept of digital <a href="/facts/Packet_switching/olDlDP1R">packet switching</a> used in modern <a href="/facts/Computer_network/3w5RM99p">computer networking</a> including the <a href="/facts/Internet/Xw1rVvJU">Internet</a>.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a><a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a> Published a series of briefings and papers about dividing information into "message blocks" and sending them over distributed networks (1960–1964).<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a><a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a></td></tr><tr><td>1874</td><td><a href="/facts/%25C3%2589mile_Baudot/AzkpcLwt">Baudot, Émile</a></td><td>French <a href="/facts/Telegraphy/JhRYDSDu">telegraphic</a> engineer; patented the <a href="/facts/Baudot_code/AuCf6WGf">Baudot code</a>, the first means of digital communication.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a> The <a href="/facts/Modem/9H0Xwtq0">modem</a> speed unit <a href="/facts/Baud/uCsmXrdT">baud</a> is named after him.</td></tr><tr><td>1960s</td><td><a href="/facts/Friedrich_L._Bauer/JlesFToV">Bauer, Friedrich L.</a></td><td>Proposed the <a href="/facts/Stack_(data_structure)/bj7l94v1">stack</a> for expression evaluation, with <a href="/facts/Edsger_W._Dijkstra/910x0MjT">Edsger W. Dijkstra</a>. Influential in establishing <a href="/facts/Computer_science/lN3pEyPz">computer science</a> as an independent discipline of science; coined the term <a href="/facts/Software_engineering/KX6cE9kz">software engineering</a>. Contributed to <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a>, fundamentals of interpretation and translation of programming languages, systematics of program development, <a href="/facts/Program_transformation/lfNb25cd">program transformation</a>, and <a href="/facts/Cryptology/e94PEVau">cryptology</a>.</td></tr><tr><td>1953</td><td><a href="/facts/Richard_E._Bellman/xButmP2X">Bellman, Richard E.</a></td><td>American <a href="/facts/Applied_mathematics/qyqklXXm">applied mathematician</a> who introduced <a href="/facts/Dynamic_programming/CLcabtmk">dynamic programming</a> (1953)</td></tr><tr><td>2018</td><td><a href="/facts/Yoshua_Bengio/796atWBU">Bengio, Yoshua</a>; <a href="/facts/Geoffrey_Hinton/HJU6lC2H">Hinton, Geoffrey</a>; <a href="/facts/Yann_LeCun/phhGMM3E">Lecun, Yann</a></td><td>Conceptual and engineering breakthroughs that have made <a href="/facts/Deep_neural_networks/JLuwD3ea">deep neural networks</a> a critical component of computing<a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a></td></tr><tr><td>1989, 1990</td><td><a href="/facts/Tim_Berners-Lee/JRv21mt9">Berners-Lee, Tim</a></td><td>Invented the <a href="/facts/World_Wide_Web/wvnTrWFq">World Wide Web</a> and sent the first HTTP communication between client and server.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a></td></tr><tr><td>1995</td><td><a href="/facts/Manuel_Blum/fl3GKhvh">Blum, Manuel</a></td><td>Contributions to the foundations of <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a> and its application to <a href="/facts/Cryptography/e94PEVau">cryptography</a> and <a href="/facts/Program_verification/BYD4GnJR">program checking</a><a class="footnote-ref" id="fnref:16" href="#fn:16"><sup>16</sup></a></td></tr><tr><td>1981 & 1986</td><td><a href="/facts/Barry_Boehm/dVrXr74F">Boehm, Barry</a></td><td>Invented parametric cost modeling (which he called "Constructive Cost Model") for software and software-intensive systems (<a href="/facts/COCOMO_II/eWMytsv4">COCOMO</a>). Invented the spiral method of software development (<a href="/facts/Spiral_model/hp10Hx87">spiral model</a>).</td></tr><tr><td>1847, 1854</td><td><a href="/facts/George_Boole/fWJT2rek">Boole, George</a></td><td>Formalized <a href="/facts/Boolean_algebra_(logic)/VkCToAmg">Boolean algebra</a>, the basis for <a href="/facts/Digital_logic/RHLulvKI">digital logic</a> and computer science.</td></tr><tr><td>1966</td><td><a href="/facts/Corrado_B%25C3%25B6hm/DQX9Wz7T">Böhm, Corrado</a></td><td>Theorized of the concept of <a href="/facts/Structured_programming/zA8b8dP1">structured programming</a>.</td></tr><tr><td>1947</td><td><a href="/facts/Kathleen_Booth/EqozPTAr">Booth, Kathleen</a></td><td>Invented the first <a href="/facts/Assembly_language/7XuV0cla">assembly language</a>.</td></tr><tr><td>1969, 1978</td><td><a href="/facts/Per_Brinch_Hansen/ofL1Pd9M">Brinch Hansen, Per</a></td><td>Developed the <a href="/facts/RC_4000_Multiprogramming_System/VSH1DyQj">RC 4000 multiprogramming system</a>, which introduced the concept of an <a href="/facts/Kernel_(operating_system)/uEj4U3Rz">operating system kernel</a> and the <a href="/facts/Separation_of_mechanism_and_policy/acvNHW2N">separation of policy and mechanism</a>; effectively the first <a href="/facts/Microkernel/wsaWtYCU">microkernel</a> architecture.<a class="footnote-ref" id="fnref:17" href="#fn:17"><sup>17</sup></a> Co-developed the <a href="/facts/Monitor_(synchronization)/g2zfRatV">monitor</a> with <a href="/facts/Tony_Hoare/vBeb3cmn">Tony Hoare</a>, and created the first monitor implementation.<a class="footnote-ref" id="fnref:18" href="#fn:18"><sup>18</sup></a> Implemented the first form of <a href="/facts/Remote_procedure_call/uMMb9CQw">remote procedure call</a> in the RC 4000,<a class="footnote-ref" id="fnref:19" href="#fn:19"><sup>19</sup></a> and was first to propose remote procedure calls as a structuring concept for <a href="/facts/Distributed_computing/o5nyhqTF">distributed computing</a>.<a class="footnote-ref" id="fnref:20" href="#fn:20"><sup>20</sup></a></td></tr><tr><td>1959, 1995</td><td><a href="/facts/Fred_Brooks/1FNtgMgE">Brooks, Fred</a></td><td>Manager of IBM <a href="/facts/System%2f360/7znvpy4K">System/360</a> and <a href="/facts/OS%2f360/nQbdNbx6">OS/360</a> projects; author of <i><a href="/facts/The_Mythical_Man-Month/wCXlLFQo">The Mythical Man-Month</a></i>.</td></tr><tr><td>1908</td><td><a href="/facts/L._E._J._Brouwer/6q6ULf3b">Brouwer, Luitzen Egbertus Jan</a></td><td>Founded <a href="/facts/Intuitionistic_logic/zI7ulCnM">intuitionistic logic</a>, which later came to prevalent use in <a href="/facts/Proof_assistant/hjFGxLPn">proof assistants</a>.</td></tr><tr><td>1954</td><td><a href="/facts/Arthur_Burks/EeqQrm7d">Burks, Arthur</a></td><td>Proposed <a href="/facts/Reverse_Polish_Notation/a6rDoJ7X">Reverse Polish Notation</a> with Don Warren and Jesse Wright in 1954, unaware of <a href="/facts/Konrad_Zuse/yrvbaEg3">Konrad Zuse</a>'s earlier use of postfix notation in his Z3 in 1941, and later independently reinvented by <a href="/facts/Friedrich_L._Bauer/JlesFToV">Friedrich L. Bauer</a> and <a href="/facts/Edsger_W._Dijkstra/910x0MjT">Edsger W. Dijkstra</a> for use with <a href="/facts/Stack_(data_structure)/bj7l94v1">stacks</a>.</td></tr><tr><td>1930</td><td><a href="/facts/Vannevar_Bush/F12rLyGQ">Bush, Vannevar</a></td><td>Analogue computing pioneer; originator of the <a href="/facts/Memex/vVmwyHyJ">Memex</a> concept, which led to the development of <a href="/facts/Hypertext/qD8ozxSb">Hypertext</a></td></tr><tr><td>1951</td><td><a href="/facts/David_Caminer/DW0zKvXw">Caminer, David</a></td><td>With <a href="/facts/John_Pinkerton_(computer_designer)/D0TWPctF">John Pinkerton</a>, developed the <a href="/facts/LEO_computer/V9PBt9qA">LEO computer</a>, the first business computer, for <a href="/facts/J._Lyons_and_Co/MM23zWoF">J. Lyons and Co</a></td></tr><tr><td>1974</td><td><a href="/facts/Edwin_Catmull/4o0C8Nrl">Catmull, Edwin</a></td><td>Computer generated imagery (CGI) and 3D graphics pioneer who developed <a href="/facts/Texture_mapping/9gDTsuXN">texture mapping</a>, the <a href="/facts/Catmull-Clark_subdivision_surface/zaoRCqU4">Catmull-Clark subdivision surface</a> algorithm (with <a href="/facts/James_H._Clark/DbY5966g">Jim Clark</a>), and the <a href="/facts/Catmull-Rom_spline/S29nwRUF">Catmull-Rom spline</a> (with <a href="/facts/Raphael_Rom/baUWRocb">Raphael Rom</a>. Former vice president of <a href="/facts/Industrial_Light_%2526_Magic/P6J0qtC7">Industrial Light & Magic</a> and co-founder of and former president of <a href="/facts/Pixar/McUyzor2">Pixar</a></td></tr><tr><td>1978</td><td><a href="/facts/Vint_Cerf/lo7mnfHt">Cerf, Vint</a></td><td>With <a href="/facts/Bob_Kahn/wooNfB4v">Bob Kahn</a>, designed the <a href="/facts/Transmission_Control_Protocol/WW4sPrt9">Transmission Control Protocol</a> and <a href="/facts/Internet_Protocol/Qq6VeEal">Internet Protocol</a> (<a href="/facts/TCP%2fIP/KNkxtSpw">TCP/IP</a>), the primary data <a href="/facts/Communication_protocols/5uady7cB">communication protocols</a> of the <a href="/facts/Internet/Xw1rVvJU">Internet</a> and other <a href="/facts/Computer_network/3w5RM99p">computer networks</a></td></tr><tr><td>1956</td><td><a href="/facts/Noam_Chomsky/3rtpzlER">Chomsky, Noam</a></td><td>Made contributions to computer science with his work in <a href="/facts/Linguistics/oQuamvf2">linguistics</a>. Developed <a href="/facts/Chomsky_hierarchy/tUYCL00R">Chomsky hierarchy</a>, directly impacting <a href="/facts/Programming_language_theory/MfecfTFI">programming language theory</a> and other branches of computer science.</td></tr><tr><td>1936</td><td><a href="/facts/Alonzo_Church/b7D52Itv">Church, Alonzo</a></td><td>Made fundamental contributions to theoretical computer science, specifically in the development of <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a> in the form of <a href="/facts/Lambda_calculus/DaD3RuQ4">lambda calculus</a>. Independently of <a href="/facts/Alan_Turing/klov9b6g">Alan Turing</a>, formulated what is now known as the <a href="/facts/Church-Turing_Thesis/hDHn641f">Church-Turing Thesis</a> and proved that <a href="/facts/First-order_logic/lcISqWIg">first-order logic</a> is <a href="/facts/Entscheidungsproblem/y8LDal2X">undecidable</a>.</td></tr><tr><td>1962</td><td><a href="/facts/Wesley_A._Clark/CpwgrHKm">Clark, Wesley A.</a></td><td>Designed <a href="/facts/LINC/ozNdFrHB">LINC</a>, the first functional computer scaled down and priced for individual users (1963). Many of its features are considered prototypes of essential elements of personal computers.</td></tr><tr><td>1981</td><td><a href="/facts/Edmund_M._Clarke/Vwrg4hQW">Clarke, Edmund M.</a></td><td>Developed <a href="/facts/Model_checking/FwvKMlw9">model checking</a> and formal verification of software and hardware, with <a href="/facts/E._Allen_Emerson/Hxj9kdfm">E. Allen Emerson</a>.</td></tr><tr><td>1987</td><td><a href="/facts/John_Cocke_(computer_scientist)/u2q0rtyw">Cocke, John</a></td><td>Significant contributions to compiler design and theory, the architecture of large systems, and the development of <a href="/facts/Reduced_instruction_set_computer/aQbGM62p">reduced instruction set computers</a> (RISC)</td></tr><tr><td>1970</td><td><a href="/facts/Edgar_F._Codd/QCSbPYkK">Codd, Edgar F.</a></td><td>Proposed and formalized the <a href="/facts/Relational_model/VFf4dDIU">relational model</a> of data management, the theoretical basis of <a href="/facts/Relational_database/pEKGmJLy">relational databases</a></td></tr><tr><td>1971</td><td><a href="/facts/Lynn_Conway/QWDhTWx5">Conway, Lynn</a></td><td><a href="/facts/Superscalar_architecture/gPxRAb25">Superscalar architecture</a> with multiple-issue out-of-order dynamic instruction scheduling</td></tr><tr><td>1967</td><td><a href="/facts/Stephen_Cook/GdE35Sm1">Cook, Stephen</a></td><td>Formalized the notion of NP-completeness, inspiring a great deal of research in <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a></td></tr><tr><td>1965</td><td><a href="/facts/James_Cooley/zy3vmXBQ">Cooley, James</a></td><td>With <a href="/facts/John_W._Tukey/2a5FbPWb">John W. Tukey</a>, created the <a href="/facts/Cooley-Tukey_FFT_algorithm/03VB7JrC">fast Fourier transform</a></td></tr><tr><td>1944</td><td><a href="/facts/Allen_Coombs/sk1Ce2o0">Coombs, Allen</a></td><td>Designed and built the Mark II <a href="/facts/Colossus_computer/pbkHLPwp">Colossus computers</a>; superseded the Mark I version (which was the world's first digital, electronic computing device)</td></tr><tr><td>1989</td><td><a href="/facts/Fernando_J._Corbat%25C3%25B3/2kXkQk3I">Corbató, Fernando J.</a></td><td>Pioneering work organizing the concepts and leading the development of the general-purpose, large-scale, <a href="/facts/Time-sharing/LE5XT9Go">time-sharing</a> and resource-sharing computer systems <a href="/facts/Compatible_Time-Sharing_System/LAIsUSEq">CTSS</a> and <a href="/facts/Multics/y7A5peyu">Multics</a></td></tr><tr><td>1964–1996</td><td><a href="/facts/Seymour_Cray/uDpXUsXc">Cray, Seymour</a></td><td>Designed a series of computers that were the fastest in the world for decades; and founded Cray Research, which built many of them; credited with creating the supercomputer industry</td></tr><tr><td>1978, 1993</td><td><a href="/facts/Dave_Cutler/VrtFsrbr">Cutler, David N.</a></td><td>Major pioneer of operating-system design through his work at <a href="/facts/Digital_Equipment_Corporation/ztxs6keA">Digital Equipment Corporation</a> and <a href="/facts/Microsoft/nGIDDXdx">Microsoft</a>, where he was lead engineer of the <a href="/facts/OpenVMS/rAnHAgpD">VMS</a> and <a href="/facts/Windows_NT/EtccWvxQ">Windows NT</a> kernels (respectively)</td></tr><tr><td>1962</td><td><a href="/facts/Ole-Johan_Dahl/4XzG0v9q">Dahl, Ole-Johan</a></td><td>With <a href="/facts/Kristen_Nygaard/2h3KoI8B">Kristen Nygaard</a>, invented the proto-object oriented language <a href="/facts/SIMULA/gaEVG7SL">SIMULA</a></td></tr><tr><td>1965</td><td><a href="/facts/Donald_Davies/zHGN8LXl">Davies, Donald</a></td><td>One of two independent inventors of the concept of digital <a href="/facts/Packet_switching/olDlDP1R">packet switching</a> used in modern <a href="/facts/Computer_network/3w5RM99p">computer networking</a> including the <a href="/facts/Internet/Xw1rVvJU">Internet</a>.<a class="footnote-ref" id="fnref:21" href="#fn:21"><sup>21</sup></a><a class="footnote-ref" id="fnref:22" href="#fn:22"><sup>22</sup></a> Conceived of and named the concept for data communication networks (1965–66).<a class="footnote-ref" id="fnref:23" href="#fn:23"><sup>23</sup></a><a class="footnote-ref" id="fnref:24" href="#fn:24"><sup>24</sup></a> Many of the wide-area packet-switched networks of the 1970s, including <a href="/facts/ARPANET/LyMGWurJ">ARPANET</a>, were similar "in nearly all respects" to his original 1965 design.<a class="footnote-ref" id="fnref:25" href="#fn:25"><sup>25</sup></a></td></tr><tr><td>1976</td><td><a href="/facts/Whitfield_Diffie/oDKz7ChA">Diffie, Whitfield</a></td><td>Fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper "New Directions in Cryptography"<a class="footnote-ref" id="fnref:26" href="#fn:26"><sup>26</sup></a> introduced the ideas of public-key cryptography and digital signatures, the foundation of security protocols used on the Internet today.<a class="footnote-ref" id="fnref:27" href="#fn:27"><sup>27</sup></a></td></tr><tr><td>1968</td><td><a href="/facts/Edsger_Dijkstra/910x0MjT">Dijkstra, Edsger W.</a></td><td>Pioneered the <a href="/facts/Dijkstra%2527s_algorithm/ehun88jl">shortest path algorithm</a>; coined the term <a href="/facts/Structured_programming/zA8b8dP1">structured programming</a>; invented the <a href="/facts/Semaphore_(programming)/BrE1W4Je">semaphore</a>; famously suggested that the <a href="/facts/Goto_(command)/V3bV9yVn">GOTO statement</a> should be <a href="/facts/Considered_harmful/DWgRL3LN">considered harmful</a></td></tr><tr><td>1918</td><td><a href="/facts/William_Eccles_(physicist)/8KA3rcgM">Eccles, William</a> and <a href="/facts/Frank_Wilfred_Jordan/jDw1NcgE">Jordan, Frank Wilfred</a></td><td>Patented the Eccles–Jordan trigger circuit,<a class="footnote-ref" id="fnref:28" href="#fn:28"><sup>28</sup></a> the so-called "bistable <a href="/facts/Flip-flop_(electronics)/vA99xjM7">flip-flop</a>", a building block of all digital <a href="/facts/Memory_cell_(computing)/beKH6ous">memory cells</a>. Built from <a href="/facts/Vacuum_tube/VHd1BNLq">vacuum tubes</a>, their concept was essential for the success of the <a href="/facts/Colossus_computer/pbkHLPwp">Colossus codebreaking computer</a>.</td></tr><tr><td>1943, 1951</td><td><a href="/facts/J._Presper_Eckert/G3bXAwdt">Eckert, J. Presper</a></td><td>With <a href="/facts/John_Mauchly/y6TeMdXU">John Mauchly</a>, designed and built <a href="/facts/ENIAC/EcfmM1Y0">ENIAC</a>, the first modern (all electronic, Turing-complete) computer; and <a href="/facts/UNIVAC_I/LQzozqY2">UNIVAC I</a>, the first commercially available computer</td></tr><tr><td>1981</td><td><a href="/facts/E._Allen_Emerson/Hxj9kdfm">Emerson, E. Allen</a></td><td>Developed <a href="/facts/Model_checking/FwvKMlw9">model checking</a> and formal verification of software and hardware, with <a href="/facts/Edmund_M._Clarke/Vwrg4hQW">Edmund M. Clarke</a></td></tr><tr><td>1963</td><td><a href="/facts/Douglas_Engelbart/gHT4dFLS">Engelbart, Douglas</a></td><td>Best known for inventing the <a href="/facts/Computer_mouse/fJpa1tUE">computer mouse</a>, with <a href="/facts/Bill_English_(computer_engineer)/spAaNQC2">Bill English</a>; pioneer of human–computer interaction whose Augment team developed <a href="/facts/Hypertext/qD8ozxSb">hypertext</a>, <a href="/facts/Computer_network/3w5RM99p">networked computers</a>, and precursors to <a href="/facts/GUI/wBlQFWDP">GUIs</a></td></tr><tr><td>1971</td><td><a href="/facts/Federico_Faggin/XIsoopIf">Faggin, Federico</a></td><td>Designed the first commercial microprocessor, <a href="/facts/Intel_4004/kAoetjSU">Intel 4004</a></td></tr><tr><td>1994</td><td><a href="/facts/Edward_Feigenbaum/zqMzJt6C">Feigenbaum, Edward</a></td><td>Pioneering the design and construction of large-scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology<a class="footnote-ref" id="fnref:29" href="#fn:29"><sup>29</sup></a></td></tr><tr><td>1974</td><td><a href="/facts/Elizabeth_Feinler/ucJBk4lL">Feinler, Elizabeth</a></td><td>Led team that defined a simple text file format for Internet host names, which became the <a href="/facts/Domain_Name_System/rfxdWFsj">Domain Name System</a>; her group became the naming authority for the top-level domains of .mil, .gov, .edu, .org, and .com</td></tr><tr><td>1943</td><td><a href="/facts/Tommy_Flowers/0NDMVlNN">Flowers, Tommy</a></td><td>Designed and built the Mark I <a href="/facts/Colossus_computer/pbkHLPwp">Colossus computer</a>, the world's first programmable, digital, electronic, computing devices</td></tr><tr><td>1978</td><td><a href="/facts/Robert_W._Floyd/sTFRb3TH">Floyd, Robert W.</a></td><td>Had a clear influence on methodologies for the creation of efficient and reliable software; helped to found these important sub-fields of <a href="/facts/Computer_science/lN3pEyPz">computer science</a>: theory of <a href="/facts/Parsing/nRKB01S3">parsing</a>, <a href="/facts/Semantics/1L4WwLAP">semantics</a> of programming languages, automatic <a href="/facts/Program_verification/BYD4GnJR">program verification</a>, <a href="/facts/Automatic_programming/zrrwX3CW">automatic program synthesis</a>, and <a href="/facts/Analysis_of_algorithms/pStoBgBn">analysis of algorithms</a><a class="footnote-ref" id="fnref:30" href="#fn:30"><sup>30</sup></a></td></tr><tr><td>1994</td><td><a href="/facts/Sally_Floyd/f6QUVc8H">Floyd, Sally</a></td><td>Founded the field of Active Queue Management; co-invented <a href="/facts/Random_early_detection/h2YyDNQL">Random Early Detection</a>, used in almost all Internet routers</td></tr><tr><td>1879</td><td><a href="/facts/Gottlob_Frege/FXyStVYj">Frege, Gottlob</a></td><td>Extended Aristotelian logic with <a href="/facts/First-order_predicate_calculus/lcISqWIg">first-order predicate calculus</a> independently of <a href="/facts/Charles_Sanders_Peirce/z76dNqhM">Charles Sanders Peirce</a>, a crucial precursor in <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a>; also relevant to early work on <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>, <a href="/facts/Logic_programming/Xgh8lj3F">logic programming</a></td></tr><tr><td>1985</td><td><a href="/facts/Stephen_Furber/Tr51Bqoa">Furber, Stephen</a> <a href="/facts/Sophie_Wilson/9pkb5BXL">Wilson, Sophie</a></td><td>Led the creation of the ARM 32-bit RISC microprocessor<a class="footnote-ref" id="fnref:31" href="#fn:31"><sup>31</sup></a></td></tr><tr><td>1958, 1961, 1967</td><td><a href="/facts/Seymour_Ginsburg/l5Are2u3">Ginsburg, Seymour</a></td><td>Proved "<a href="/facts/Don%2527t-care_term/kvQuwYMK">don't-care</a>" circuit minimization does not necessarily yield optimal results; proved that the <a href="/facts/ALGOL/wlFJGNEx">ALGOL</a> programming language was context-free (linking <a href="/facts/Formal_language/crDTyP8q">formal language</a> theory to the problem of <a href="/facts/Compiler/WNfCDFJe">compiler</a> writing); invented <a href="/facts/Abstract_family_of_languages/QC4HUyXt">AFL Theory</a></td></tr><tr><td>1931</td><td><a href="/facts/Kurt_G%25C3%25B6del/P14DqKqK">Gödel, Kurt</a></td><td>Proved that <a href="/facts/Peano_arithmetic/DhhDnNug">Peano arithmetic</a> could not be both <a href="/facts/Logically_consistent/IHkdnA9M">logically consistent</a> and complete in <a href="/facts/First-order_predicate_calculus/lcISqWIg">first-order predicate calculus</a>. Church, Kleene, and Turing developed the foundations of computation theory based on <a href="/facts/Corollaries/ntQ8zR9N">corollaries</a> to Gödel's work.</td></tr><tr><td>1989</td><td><a href="/facts/Shafi_Goldwasser/aTJJq4mB">Goldwasser, Shafi</a></td><td>Invented <a href="/facts/Zero-knowledge_proof/38soaPT5">zero-knowledge proofs</a> with <a href="/facts/Silvio_Micali/IxgCplaX">Micali</a> and <a href="/facts/Charles_Rackoff/ydjGtEXD">Rackoff</a>; she and Micali received the <a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a> (2012) for this and other work.</td></tr><tr><td>2011</td><td><a href="/facts/Susan_L._Graham/IVQ8G6jG">Graham, Susan L.</a>[<i>undue weight? – discuss</i>]</td><td>Awarded the 2009 <a href="/facts/IEEE_John_von_Neumann_Medal/eABth7GF">IEEE John von Neumann Medal</a> for "contributions to programming language design and implementation and for exemplary service to the discipline of computer science"</td></tr><tr><td>1953</td><td><a href="/facts/Frank_Gray_(researcher)/VLdD5Kbt">Gray, Frank</a></td><td>Physicist and researcher at <a href="/facts/Bell_Labs/fKP5Gk0H">Bell Labs</a>, developed the reflected binary code (RBC) or <a href="/facts/Gray_code/HtbVlM7T">Gray code</a>.<a class="footnote-ref" id="fnref:32" href="#fn:32"><sup>32</sup></a> Gray's methodologies are used for error detection and correction in digital communication systems, such as <a href="/facts/QAM/02j52SWG">QAM</a> in <a href="/facts/Digital_subscriber_line/3pY5osov">digital subscriber line</a> networks.</td></tr><tr><td>1974, 2005</td><td><a href="/facts/Jim_Gray_(computer_scientist)/UAcg9v2b">Gray, Jim</a></td><td>Innovator in <a href="/facts/Database_systems/VYcpkevb">database systems</a> and <a href="/facts/Transaction_processing/Q0WHeD9R">transaction processing</a> implementation</td></tr><tr><td>1986, 1990</td><td><a href="/facts/Barbara_Grosz/koNm4ovJ">Grosz, Barbara</a>[<i>undue weight? – discuss</i>]</td><td>Created the first computational model of <a href="/facts/Discourse/6qITpvKg">discourse</a>, establishing the field of research and influencing language-processing technologies; developed SharedPlans model for collaboration in <a href="/facts/Multi-agent_systems/A85vt3UA">multi-agent systems</a></td></tr><tr><td>1988, 2015</td><td><a href="/facts/John_Gustafson_(scientist)/h8qV1z0E">Gustafson, John</a></td><td>Proved the viability of parallel computing experimentally and theoretically; formulated <a href="/facts/Gustafson%2527s_law/7z2S6dXb">Gustafson's Law</a>; developed high-efficiency formats for representing real numbers <a href="/facts/Unum_(number_format)/Bo3XNr7C">Unum</a> and <a href="/facts/Unum_(number_format)/Bo3XNr7C">Posit</a></td></tr><tr><td>1971</td><td><a href="/facts/Margaret_Hamilton_(scientist)/EcKvltNs">Hamilton, Margaret</a></td><td>Developed the concepts of asynchronous software, priority scheduling, end-to-end testing, and human-in-the-loop decision capability, such as priority displays which then became the foundation for ultra-reliable software design</td></tr><tr><td>1950</td><td><a href="/facts/Richard_Hamming/plAXy9p0">Hamming, Richard</a></td><td>Created the fields of <a href="/facts/Error-correcting_code/cLUTUJrA">error-correcting code</a>, <a href="/facts/Hamming_code/zsI8cTRC">Hamming code</a>, <a href="/facts/Hamming_matrix/zsI8cTRC">Hamming matrix</a>, the <a href="/facts/Hamming_window/5Xj7h2ah">Hamming window</a>, <a href="/facts/Hamming_numbers/A3RfECgS">Hamming numbers</a>, <a href="/facts/Sphere-packing/NY2FKyMf">sphere-packing</a> (or <a href="/facts/Hamming_bound/3P8HVgGF">Hamming bound</a>), and the <a href="/facts/Hamming_distance/MgdtbYPo">Hamming distance</a>;<a class="footnote-ref" id="fnref:33" href="#fn:33"><sup>33</sup></a><a class="footnote-ref" id="fnref:34" href="#fn:34"><sup>34</sup></a> established the concept of <a href="/facts/Hamming_bound/3P8HVgGF">perfect code</a><a class="footnote-ref" id="fnref:35" href="#fn:35"><sup>35</sup></a><a class="footnote-ref" id="fnref:36" href="#fn:36"><sup>36</sup></a></td></tr><tr><td>1956, 1958, 1974</td><td><a href="/facts/Wolfgang_H%25C3%25A4ndler/BvcRS5x5">Händler, Wolfgang</a></td><td>Pioneering work on <a href="/facts/Automata_theory/Q6BmPv63">automata theory</a>, <a href="/facts/Parallel_computing/nQzcpzQt">parallel computing</a>, <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>, <a href="/facts/Man-machine_interface/e9sPEWVD">man-machine interfaces</a> and <a href="/facts/Computer_graphics/lapBE8wv">computer graphics</a>; one of the lead architects of the TR 4 [de] supercomputer; invented <a href="/facts/H%25C3%25A4ndler_diagram/7wSV4nut">Händler diagrams</a> for <a href="/facts/Logic_function_minimization/7wSV4nut">logic function minimization</a>; devised the Erlangen Classification System [de] (ECS) for parallel computers</td></tr><tr><td>2019</td><td><a href="/facts/Pat_Hanrahan/np0rxDJf">Hanrahan, Pat</a></td><td>Fundamental contributions to 3D computer graphics, with revolutionary impact on computer-generated imagery (CGI) in filmmaking and other applications</td></tr><tr><td>1993</td><td><a href="/facts/Juris_Hartmanis/MkgqlhQb">Hartmanis, Juris</a></td><td>Foundations for the field of <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a><a class="footnote-ref" id="fnref:37" href="#fn:37"><sup>37</sup></a></td></tr><tr><td>1981, 1995, 1999</td><td><a href="/facts/Anders_Hejlsberg/E1GJCekr">Hejlsberg, Anders</a></td><td>Author of <a href="/facts/Turbo_Pascal/2aWFEk9z">Turbo Pascal</a> at <a href="/facts/Borland/crI5pTzW">Borland</a>; chief architect of <a href="/facts/Delphi_(software)/sUFUXQ8r">Delphi</a>; designer and lead architect of <a href="/facts/C_Sharp_(programming_language)/UC2gxeyb">C#</a> at Microsoft</td></tr><tr><td>1976</td><td><a href="/facts/Martin_Hellman/QCxKCFgn">Hellman, Martin</a></td><td>Fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography",<a class="footnote-ref" id="fnref:38" href="#fn:38"><sup>38</sup></a> introduced the ideas of public-key cryptography and digital signatures, the foundation for security protocols on the Internet today<a class="footnote-ref" id="fnref:39" href="#fn:39"><sup>39</sup></a></td></tr><tr><td>2017</td><td><a href="/facts/John_L._Hennessy/sbfqPY9u">Hennessy, John L.</a></td><td>Pioneered a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry</td></tr><tr><td>2008, 2012, 2018</td><td><a href="/facts/Geoffrey_Hinton/HJU6lC2H">Hinton, Geoffrey</a></td><td>Popularized and enabled the use of <a href="/facts/Artificial_neural_networks/6V1jMlkx">artificial neural networks</a> and <a href="/facts/Deep_learning/JLuwD3ea">deep learning</a>, among the most successful tools in modern <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a> efforts; received the Turing Award (2018) for conceptual and engineering breakthroughs that have made <a href="/facts/Deep_neural_networks/JLuwD3ea">deep neural networks</a> a critical component of computing<a class="footnote-ref" id="fnref:40" href="#fn:40"><sup>40</sup></a></td></tr><tr><td>1961, 1969, 1978, 1980</td><td><a href="/facts/Tony_Hoare/vBeb3cmn">Hoare, C. A. R.</a></td><td>Developed the formal language <a href="/facts/Communicating_Sequential_Processes/bzKGnJ50">Communicating Sequential Processes</a> (CSP), <a href="/facts/Hoare_logic/UoMg08wo">Hoare logic</a> for verifying program correctness, and <a href="/facts/Quicksort/1BeqhLAH">Quicksort</a>; fundamental contributions to the definition and design of programming languages</td></tr><tr><td>1968</td><td><a href="/facts/Betty_Holberton/JqwNJM7y">Holberton, Betty</a></td><td>Wrote the first <a href="/facts/Mainframe_sort_merge/Wp7LUPcG">mainframe sort merge</a> on the <a href="/facts/Univac/FhJlhtva">Univac</a></td></tr><tr><td>1889</td><td><a href="/facts/Herman_Hollerith/rxpnvpgz">Hollerith, Herman</a></td><td>Widely regarded as the father of modern <a href="/facts/History_of_computing_hardware/83xXSmuW">machine data processing</a>, his invention of the <a href="/facts/Punched_card/44WsPulQ">punched card tabulating machine</a> marked the beginning of the era of semiautomatic <a href="/facts/Data_processing/74EKCDAq">data processing</a> systems</td></tr><tr><td>1986</td><td><a href="/facts/John_Hopcroft/j42ejf1m">Hopcroft, John</a></td><td>Fundamental achievements in the design and analysis of algorithms and data structures</td></tr><tr><td>1952</td><td><a href="/facts/Grace_Hopper/MEhbGazn">Hopper, Grace</a></td><td>Pioneered work on the necessity for high-level programming languages, which she termed <i>automatic programming</i>; wrote the A-O <a href="/facts/Compiler/WNfCDFJe">compiler</a>, which heavily influenced the <a href="/facts/COBOL/wVnhqs0k">COBOL</a> language</td></tr><tr><td>1997</td><td><a href="/facts/Feng-hsiung_Hsu/s3CtSduH">Hsu Feng-hsiung</a></td><td>Work leading to the creation of the <a href="/facts/Deep_Thought_(chess_computer)/cJ9reS8q">Deep Thought</a> chess computer; architect and principal designer <a href="/facts/IBM_Deep_Blue/7lnCRVup">IBM Deep Blue</a> chess computer that defeated the reigning <a href="/facts/World_Chess_Championship/XPdyx85g">World Chess Champion</a>, <a href="/facts/Garry_Kasparov/NNjULdHH">Garry Kasparov</a>, in 1997</td></tr><tr><td>1952</td><td><a href="/facts/David_Albert_Huffman/4fbz13XB">Huffman, David</a></td><td>Created <a href="/facts/Huffman_coding/dBgMBz48">Huffman coding</a></td></tr><tr><td>1952</td><td><a href="/facts/Cuthbert_Hurd/qMQ3Yxhv">Hurd, Cuthbert</a></td><td>Helped IBM develop its first general-purpose computer, the <a href="/facts/IBM_701/6ngzwkFp">IBM 701</a></td></tr><tr><td>1945, 1953</td><td><a href="/facts/Harry_Huskey/n9YvCB8z">Huskey, Harry</a></td><td>Contributions to the design of early computers including <a href="/facts/ENIAC/EcfmM1Y0">ENIAC</a>, <a href="/facts/EDVAC/6DHxuu2d">EDVAC</a>, <a href="/facts/Pilot_ACE/88h5ugKz">Pilot ACE</a>, <a href="/facts/EDVAC/6DHxuu2d">EDVAC</a>, <a href="/facts/SEAC_(computer)/Hkt7UCJx">SEAC</a>, <a href="/facts/SWAC_(computer)/kBJEN7s8">SWAC</a>, and <a href="/facts/Bendix_G-15/QMFMfpLW">Bendix G-15</a> (the latter described as the first <a href="/facts/Personal_computer/koaYfNce">personal computer</a>, being operable by one person)</td></tr><tr><td>1954, 1962</td><td><a href="/facts/Kenneth_E._Iverson/2K4c4hsh">Iverson, Kenneth</a></td><td>Helped establish and taught the first graduate course in computer science (at <a href="/facts/Harvard_University/Lhy9L1cx">Harvard</a>); invented the <a href="/facts/APL_programming_language/E2sb98gC">APL programming language</a>; contributions to interactive computing</td></tr><tr><td>1801</td><td><a href="/facts/Joseph_Marie_Jacquard/Ut1FsVrQ">Jacquard, Joseph Marie</a></td><td>Built and demonstrated the <a href="/facts/Jacquard_loom/KqFkGCUs">Jacquard loom</a>, a programmable mechanized loom controlled by a tape constructed from punched cards</td></tr><tr><td>1206</td><td><a href="/facts/Al-Jazari/ycMzl2tU">Al-Jazari</a></td><td>Invented <a href="/facts/Program_(machine)/2e2GCRFA">programmable</a> machines, including programmable <a href="/facts/Humanoid_robot/0l82ABSc">humanoid robots</a>,<a class="footnote-ref" id="fnref:41" href="#fn:41"><sup>41</sup></a> and the <a href="/facts/Castle_clock/jtdLDPXY">castle clock</a>, an <a href="/facts/Astronomical_clock/8yaTPexw">astronomical clock</a> considered the first <a href="/facts/Computer_programming/QmSsFnu0">programmable</a> <a href="/facts/Analog_computer/3NhYoCML">analog computer</a><a class="footnote-ref" id="fnref:42" href="#fn:42"><sup>42</sup></a></td></tr><tr><td>1989</td><td><a href="/facts/William_Kahan/J1GNQDyN">Kahan, William</a></td><td>Fundamental contributions to <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a>; foremost expert on <a href="/facts/Floating_point/eIckahxe">floating-point</a> computations; dedicated to "making the world safe for numerical computations"</td></tr><tr><td>1978</td><td><a href="/facts/Bob_Kahn/wooNfB4v">Kahn, Bob</a></td><td>Designed the <a href="/facts/Transmission_Control_Protocol/WW4sPrt9">Transmission Control Protocol</a> and <a href="/facts/Internet_Protocol/Qq6VeEal">Internet Protocol</a> (<a href="/facts/TCP%2fIP/KNkxtSpw">TCP/IP</a>), the primary data <a href="/facts/Communication_protocols/5uady7cB">communication protocols</a> of the <a href="/facts/Internet/Xw1rVvJU">Internet</a> and other <a href="/facts/Computer_networks/3w5RM99p">computer networks</a></td></tr><tr><td>1952, 1953</td><td><a href="/facts/Maurice_Karnaugh/JHhvYUca">Karnaugh, Maurice</a></td><td>Creator of the <a href="/facts/Karnaugh_map/saFd8oNl">Karnaugh map</a>, a variation on <a href="/facts/Edward_Veitch/wSG20q3y">Edward Veitch</a>'s <a href="/facts/Veitch_chart/saFd8oNl">Veitch chart</a>; rediscovery of <a href="/facts/Allan_Marquand/2bHhjbI4">Allan Marquand</a>'s much earlier <a href="/facts/Marquand_diagram/saFd8oNl">logical diagram</a> used for <a href="/facts/Logic_function_minimization/7wSV4nut">logic function minimization</a></td></tr><tr><td>1985</td><td><a href="/facts/Richard_M._Karp/XtYCL0nA">Karp, Richard M.</a></td><td>Contributions to algorithm theory, including the development of efficient algorithms for network flow and other combinatorial optimization problems; identified polynomial-time computability with the intuitive notion of algorithmic efficiency; contributed to the theory of <a href="/facts/NP-complete/NFPv56DU">NP-completeness</a></td></tr><tr><td>1973</td><td><a href="/facts/Jacek_Karpinski/EnfmLGgQ">Karpinski, Jacek</a></td><td>Developed the first differential analyzer using transistors; developed one of the first machine-learning algorithms for character and image recognition; invented of one of the first minicomputers, the <a href="/facts/K-202/0S8cYlyd">K-202</a></td></tr><tr><td>1970~</td><td><a href="/facts/Alan_Kay/opDYqrcm">Kay, Alan</a></td><td>Pioneered many ideas at the root of object-oriented programming languages; led the team that developed <a href="/facts/Smalltalk/Ru2UPVDE">Smalltalk</a>; made fundamental contributions to personal computing</td></tr><tr><td>1948–1990s</td><td><a href="/facts/Tom_Kilburn/TTT1MnBA">Kilburn, Tom</a></td><td>With Freddie Williams he worked on the Williams–Kilburn tube and developed the world's first electronic stored-program computer, the Manchester Baby, while working at the University of Manchester. His work propelled Manchester and Britain into the forefront of the emerging field of computer science. He also worked on the development of Atlas, one of the most powerful supercomputer in 1960s.</td></tr><tr><td>1972–1994</td><td><a href="/facts/Gary_Kildall/yzxo0mLU">Kildall, Gary</a></td><td>Introduced the theory of <a href="/facts/Data-flow_analysis/jz2oI6sX">data-flow analysis</a> in <a href="/facts/Optimizing_compiler/JXnv4LUd">optimizing compilers</a> (global expression optimization, <a href="/facts/Kildall%2527s_method/jz2oI6sX">Kildall's method</a>). Worked on instruction set emulators (<a href="/facts/INTERP/32FvNTcD">INTERP</a>), found an innovative software relocation method (<a href="/facts/Page_boundary_relocation/yKQLrrPE">page boundary relocation</a>), and laid the foundation to the concepts of <a href="/facts/Binary_recompilation/evkIC1to">binary recompilation</a> (<a href="/facts/XLT86/MnSVwoe9">XLT86</a>). Developed the first high-level <a href="/facts/Programming_language/cWTYbgWa">programming language</a> and compiler for <a href="/facts/Microcomputer/ETW22UTv">microcomputers</a> (<a href="/facts/PL%2fM/GaCkqILu">PL/M</a>) and the first mainstream <a href="/facts/Operating_system/8XTuvMh2">operating system</a> for microcomputers (<a href="/facts/CP%2fM/n5rTgXdC">CP/M</a>). Invented the concept of a <a href="/facts/Hardware_abstraction_layer/9duTocz5">hardware abstraction layer</a> called the <a href="/facts/BIOS/AYYPUogS">BIOS</a>, with both conceptually laying the foundation to all <a href="/facts/DOS/sWwDXNmX">DOS</a>-based operating systems on <a href="/facts/Personal_computer/koaYfNce">personal computers</a>. Worked on <a href="/facts/Diskette/rShxfuxa">diskette</a> track <a href="/facts/Disk_buffer/rvrlT8YE">buffering</a> schemes, <a href="/facts/Read-ahead/rvrlT8YE">read-ahead</a> algorithms, <a href="/facts/Virtual_disk/vdFff04T">virtual disk</a> drives, and <a href="/facts/File_system/FdPm90uc">file system</a> <a href="/facts/Cache_(computing)/gmJYN8wm">caching</a>. Developed the first computer interface for <a href="/facts/Video_disk/87gb1XJ5">video disks</a> and pioneered <a href="/facts/CD-ROM/JwuaYLJv">CD-ROM</a> file systems, introducing the first <a href="/facts/Encyclopedia/fRsmb4q6">encyclopedia</a> for computers (<a href="/facts/The_Electronic_Encyclopedia/qq4qIDfX">The Electronic Encyclopedia</a>). Pioneered a modular <a href="/facts/Private_branch_exchange/eLWvlhzs">PBX</a> communication system integrating <a href="/facts/Plain_old_telephone_service/7uEc2wFY">land-lines</a> with <a href="/facts/Mobile_phone/H3EcqD9h">mobile phones</a> (<a href="/facts/Intelliphone_(PLS)/yzxo0mLU">Intelliphone</a>) and to remotely connect with <a href="/facts/Home_appliance/JYKalzw6">home appliances</a>.</td></tr><tr><td>1957</td><td><a href="/facts/Russell_Kirsch/PAEUbIhf">Kirsch, Russell Gray</a></td><td>Whilst working for the <a href="/facts/National_Bureau_of_Standards/gr9Fnh85">National Bureau of Standards</a> (NBS), Kirsch used a recently developed <a href="/facts/Image_scanner/7DEJFTwx">image scanner</a> to scan and store the first <a href="/facts/Digital_photograph/a2UfweJh">digital photograph</a>.<a class="footnote-ref" id="fnref:43" href="#fn:43"><sup>43</sup></a> His scanned photo of his three-month-old son was deemed by <a href="/facts/Life_(magazine)/t3r71BEK"><i>Life</i> magazine</a> as one of the "100 Photographs That Changed The World".</td></tr><tr><td>1961–1970s</td><td><a href="/facts/Leonard_Kleinrock/oj6b357M">Kleinrock, Leonard</a></td><td>Pioneered the application of <a href="/facts/Queueing_theory/8NDl56EM">queueing theory</a> to model delays in <a href="/facts/Message_switching/Jro8I31X">message switching</a> networks in his Ph.D. thesis in 1961–1962, published as a book in 1964.<a class="footnote-ref" id="fnref:44" href="#fn:44"><sup>44</sup></a> He later published several of the standard works on the subject. In the early 1970s, he applied queueing theory to model the performance of <a href="/facts/Packet_switching/olDlDP1R">packet switching</a> networks. This work played an influential role in the development of the <a href="/facts/ARPANET/LyMGWurJ">ARPANET</a>, the precursor to the <a href="/facts/Internet/Xw1rVvJU">Internet</a>. He supervised the graduate students who worked on the early <a href="/facts/Communication_protocol/5uady7cB">communication protocols</a> for the ARPANET. His theoretical work on <a href="/facts/Hierarchical_routing/b0mCqsXA">hierarchical routing</a> in the late 1970s with student <a href="/facts/Farouk_Kamoun/NKs7uV9K">Farouk Kamoun</a> remains critical to the operation of the Internet today.</td></tr><tr><td>1936</td><td><a href="/facts/Stephen_Cole_Kleene/sKSax2se">Kleene, Stephen Cole</a></td><td>Pioneered work with <a href="/facts/Alonzo_Church/b7D52Itv">Alonzo Church</a> on the <a href="/facts/Lambda_Calculus/DaD3RuQ4">Lambda Calculus</a> that first laid down the foundations of computation theory.</td></tr><tr><td>1968, 1989</td><td><a href="/facts/Donald_Knuth/GozNzDM6">Knuth, Donald</a></td><td>Wrote <i><a href="/facts/The_Art_of_Computer_Programming/MR1bMD9e">The Art of Computer Programming</a></i> and created <a href="/facts/TeX/HDrl3Yvd">TeX</a>. Coined the term "analysis of algorithms" and made major contributions to that field, including popularizing <a href="/facts/Big_O_notation/weFFjSWg">Big O notation</a>.</td></tr><tr><td>1990–1993</td><td><a href="/facts/Simon_S._Lam/obQgMp2m">Lam, Simon S.</a></td><td>Lam was inducted into the Internet Hall of Fame (2023) by the <a href="/facts/Internet_Society/scIaot5x">Internet Society</a> for “inventing secure sockets in 1991 and implementing the first secure sockets layer, named SNP, in 1993.”<a class="footnote-ref" id="fnref:45" href="#fn:45"><sup>45</sup></a> In 1990, he conceived the idea of a new security sublayer in the Internet protocol stack. This way, application programmers do not need to know much about implementation details for security. Also, the upper interface of the sublayer would enable implementation changes in the future. Lam's idea of a sublayer which offers a “secure sockets interface” to applications was novel and a radical departure from contemporary security research for Internet applications (e.g., MIT's Kerberos, 1988–1992). SNP was created for Internet applications in general. Subsequent secure sockets layers, SSL and <a href="/facts/Transport_Layer_Security/pGy16TnA">TLS</a>, developed years later for commercial browsers, followed the same architecture and key ideas of SNP. Today, TLS 1.3 is used not only for all <a href="/facts/E-commerce/7vxeea0Y">e-commerce</a> applications (banking, shopping, etc.) on WWW, but also for email, and many other Internet applications.</td></tr><tr><td>1950–1960</td><td><a href="/facts/Hedy_Lamarr/j6LwkVeh">Lamarr, Hedy</a></td><td>At the beginning of World War II, she and composer <a href="/facts/George_Antheil/P9px4gjh">George Antheil</a> developed a radio guidance system for <a href="/facts/Allies_of_World_War_II/YzCdtjDY">Allied</a> <a href="/facts/Torpedo/RLLPpktk">torpedoes</a> that used <a href="/facts/Spread_spectrum/0NKdJX1S">spread spectrum</a> and <a href="/facts/Frequency_hopping/hJS6o3xy">frequency hopping</a> technology to defeat the threat of <a href="/facts/Radio_jamming/j4xyPQsQ">jamming</a> by the <a href="/facts/Axis_powers/Q3z1D8R9">Axis powers</a>. Although the <a href="/facts/US_Navy/xYK0fUou">US Navy</a> did not adopt the technology until the 1960s, the principles of their work are incorporated into <a href="/facts/Bluetooth/sWAjpMrj">Bluetooth</a> and <a href="/facts/GPS/DKVLnzF3">GPS</a> technology and are similar to methods used in legacy versions of <a href="/facts/CDMA/o2RLKE4M">CDMA</a> and <a href="/facts/Wi-Fi/u94quCsx">Wi-Fi</a>. This work led to their induction into the <a href="/facts/National_Inventors_Hall_of_Fame/YIULqGDT">National Inventors Hall of Fame</a> in 2014.</td></tr><tr><td>1974, 1978</td><td><a href="/facts/Leslie_Lamport/jGCarz9C">Lamport, Leslie</a></td><td>Formulated algorithms to solve many fundamental problems in distributed systems (e.g. the <a href="/facts/Lamport%2527s_bakery_algorithm/LhNIQ02p">bakery algorithm</a>).Developed the concept of a <a href="/facts/Lamport_timestamps/Dpxw6Ia4">logical clock</a>, enabling synchronization between distributed entities based on the events through which they communicate. Created <a href="/facts/LaTeX/c1lvjF0A">LaTeX</a>.</td></tr><tr><td>1972</td><td><a href="/facts/Butler_W._Lampson/PEU8LN9X">Lampson, Butler W.</a></td><td>Development of distributed, personal computing environments and the technology for their implementation: <a href="/facts/Workstation/h5tK4hTt">workstations</a>, <a href="/facts/Computer_network/3w5RM99p">networks</a>, <a href="/facts/Operating_system/8XTuvMh2">operating systems</a>, programming systems, <a href="/facts/Computer_display/NRaTDFHc">displays</a>, <a href="/facts/Computer_security/7E5dIy7G">security</a> and <a href="/facts/Word_processor/qAR7lagF">document publishing</a>.</td></tr><tr><td>1964–1966</td><td><a href="/facts/Peter_Landin/V7dtseWL">Landin, Peter</a></td><td>Used the <a href="/facts/Lambda_calculus/DaD3RuQ4">lambda calculus</a> to formally specify the semantics of programming languages, and developed an early <a href="/facts/Functional_programming/cdxqPEIM">functional</a> <a href="/facts/Programming_language/cWTYbgWa">programming language</a> named <a href="/facts/ISWIM/fSMk6YbA">ISWIM</a>.</td></tr><tr><td>1951</td><td><a href="/facts/Sergei_Alekseyevich_Lebedev/36nBNIuc">Lebedev, Sergei Alekseyevich</a></td><td>Independently designed the first electronic computer in the Soviet Union, <a href="/facts/MESM/aUodDQRK">MESM</a>, in Kiev, Ukraine.</td></tr><tr><td>1670~</td><td><a href="/facts/Gottfried_Leibniz/cTc2er83">Leibniz, Gottfried</a></td><td>Made advances in symbolic logic, such as the <a href="/facts/Calculus_ratiocinator/EX3tS7NM">Calculus ratiocinator</a>, that were heavily influential on <a href="/facts/Gottlob_Frege/FXyStVYj">Gottlob Frege</a>. He anticipated later developments in <a href="/facts/First-order_predicate_calculus/lcISqWIg">first-order predicate calculus</a>, which were crucial for the theoretical foundations of computer science.</td></tr><tr><td>1960</td><td><a href="/facts/J._C._R._Licklider/QaL9FHPp">Licklider, J. C. R.</a></td><td>Began the investigation of human–computer interaction, leading to many advances in computer interfaces as well as in <a href="/facts/Cybernetics/4qb58zbt">cybernetics</a> and <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>.</td></tr><tr><td>1987</td><td><a href="/facts/Barbara_Liskov/EgjpztD5">Liskov, Barbara</a></td><td>Developed the <a href="/facts/Liskov_substitution_principle/r2vHVwa5">Liskov substitution principle</a>, which guarantees <a href="/facts/Formal_semantics_of_programming_languages/JEP1zyBv">semantic</a> interoperability of <a href="/facts/Data_type/fcx5hgVL">data types</a> in a hierarchy.</td></tr><tr><td>1300~</td><td><a href="/facts/Ramon_Llull/MnK265Y1">Llull, Ramon</a></td><td>Designed multiple symbolic representations machines, and pioneered notions of symbolic representation and manipulation to produce knowledge—both of which were major influences on <a href="/facts/Gottfried_Wilhelm_Leibniz/cTc2er83">Leibniz</a>.</td></tr><tr><td>1852</td><td><a href="/facts/Ada_Lovelace/s3c2GGRu">Lovelace, Ada</a></td><td>An English mathematician and writer, chiefly known for her work on Charles Babbage's proposed mechanical general-purpose computer, the <a href="/facts/Analytical_Engine/Ts9xduLI">Analytical Engine</a>. She was the first to recognize that the machine had applications beyond pure calculation, and created the first algorithm intended to be carried out by such a machine. As a result, she is often regarded as the first to recognize the full potential of a "computing machine" and the first computer programmer.</td></tr><tr><td>1909</td><td><a href="/facts/Percy_Ludgate/PIyqyEqH">Ludgate, Percy</a></td><td><a href="/facts/Charles_Babbage/T3jklQcd">Charles Babbage</a> in 1843 and Percy Ludgate in 1909 designed the first two <a href="/facts/Analytical_Engine/Ts9xduLI">Analytical Engines</a> in history. Ludgate's engine used multiplication as its basis (using his own discrete <a href="/facts/Irish_logarithms/dnyJulkX">Irish logarithms</a>), had the first multiplier-accumulator (MAC), was first to exploit a MAC to perform division, stored numbers as displacements of rods in shuttles, and had several other novel features, including for program control.</td></tr><tr><td>1971</td><td><a href="/facts/Per_Martin-L%25C3%25B6f/QmFINtpd">Martin-Löf, Per</a></td><td>Published an early draft on the type theory that many <a href="/facts/Proof_assistant/hjFGxLPn">proof assistants</a> build on.</td></tr><tr><td>1943, 1951</td><td><a href="/facts/John_Mauchly/y6TeMdXU">Mauchly, John</a></td><td>With <a href="/facts/J._Presper_Eckert/G3bXAwdt">J. Presper Eckert</a>, designed and built the <a href="/facts/ENIAC/EcfmM1Y0">ENIAC</a>, the first modern (all electronic, Turing-complete) computer, and the <a href="/facts/UNIVAC_I/LQzozqY2">UNIVAC I</a>, the first commercially available computer. Also worked on <a href="/facts/BINAC/HcSpFW5J">BINAC</a> (1949), <a href="/facts/EDVAC/6DHxuu2d">EDVAC</a> (1949), <a href="/facts/UNIVAC/FhJlhtva">UNIVAC</a> (1951) with <a href="/facts/Grace_Hopper/MEhbGazn">Grace Hopper</a> and <a href="/facts/Jean_Bartik/DRQ0huSh">Jean Bartik</a>, to develop early <a href="/facts/Stored_program/CwcIk5S8">stored program</a> computers.</td></tr><tr><td>1958</td><td><a href="/facts/John_McCarthy_(computer_scientist)/ajKU4SdD">McCarthy, John</a></td><td>Invented <a href="/facts/LISP/xJHA3CrX">LISP</a>, a <a href="/facts/Functional_programming/cdxqPEIM">functional</a> <a href="/facts/Programming_language/cWTYbgWa">programming language</a>.</td></tr><tr><td>1956, 2012</td><td><a href="/facts/Edward_J._McCluskey/5L7gmj3u">McCluskey, Edward J.</a></td><td>Fundamental contributions that shaped the design and testing of digital systems, including the first algorithm for digital logic synthesis, the Quine-McCluskey logic minimization method.</td></tr><tr><td>1986</td><td><a href="/facts/Bertrand_Meyer/fHywGneP">Meyer, Bertrand</a></td><td>Developed <a href="/facts/Design_by_contract/PjacMRRd">design by contract</a> in the guise of the <a href="/facts/Eiffel_programming_language/gEzPjzmn">Eiffel programming language</a>.</td></tr><tr><td>2012</td><td><a href="/facts/Silvio_Micali/IxgCplaX">Micali, Silvio</a></td><td>For transformative work that laid the complexity-theoretic foundations for the science of cryptography and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory.</td></tr><tr><td>1991</td><td><a href="/facts/Robin_Milner/oMfdsRwK">Milner, Robin</a></td><td>1) <a href="/facts/LCF_theorem_prover/wJsqr2rJ">LCF</a>, the mechanization of Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool for <a href="/facts/Automated_theorem_proving/vKGvuKFI">machine assisted proof construction</a>; 2) <a href="/facts/ML_(programming_language)/RfwxASRF">ML</a>, the first language to include polymorphic <a href="/facts/Type_inference/vX9K8Qhf">type inference</a> together with a <a href="/facts/Type_safety/WxmEKq8R">type-safe</a> <a href="/facts/Exception_handling/VrJxgb9r">exception-handling</a> mechanism; 3) <a href="/facts/Calculus_of_communicating_systems/0FNkQbug">CCS</a>, a general theory of <a href="/facts/Concurrency_(computer_science)/Ctnrrq4A">concurrency</a>. In addition, he formulated and strongly advanced <a href="/facts/Full_abstraction/yRs3ygRA">full abstraction</a>, the study of the relationship between <a href="/facts/Operational_semantics/G24LXz6e">operational</a> and <a href="/facts/Denotational_semantics/yRs3ygRA">denotational</a> <a href="/facts/Semantics/1L4WwLAP">semantics</a>.<a class="footnote-ref" id="fnref:46" href="#fn:46"><sup>46</sup></a></td></tr><tr><td>1963</td><td><a href="/facts/Marvin_Minsky/HTU5MYLL">Minsky, Marvin</a></td><td>Co-founder of <a href="/facts/MIT_Computer_Science_and_Artificial_Intelligence_Laboratory/mTg66jb9">Artificial Intelligence Lab</a> at <a href="/facts/Massachusetts_Institute_of_Technology/Xk49vNA8">Massachusetts Institute of Technology</a>, author of several texts on AI and philosophy. Critic of the <a href="/facts/Perceptron/ArxdkAC1">perceptron</a>.</td></tr><tr><td>1968</td><td><a href="/facts/Charles_H._Moore/9rsgu4PF">Moore, Charles H.</a></td><td>Inventor of the <a href="/facts/Forth_(programming_language)/mYtWVNhF">Forth</a> programming language.</td></tr><tr><td>2008</td><td><a href="/facts/Satoshi_Nakamoto/jP9akWPY">Nakamoto, Satoshi</a></td><td>The <a href="/facts/Anonymity/HUJJCdv1">anonymous</a> creator or creators of <a href="/facts/Bitcoin/UJvqfray">Bitcoin</a>, the first peer-to-peer <a href="/facts/Digital_currency/ycholMaA">digital currency</a>. Nakamoto's 2008 white-paper introduced the concept of the <a href="/facts/Blockchain/8H43GgWy">blockchain</a>, a database structure that allows full trust in the <a href="/facts/Decentralized/5koMXAUs">decentralized</a> and distributed public transaction ledger of the cryptocurrency.<a class="footnote-ref" id="fnref:47" href="#fn:47"><sup>47</sup></a></td></tr><tr><td>1934, 1938</td><td><a href="/facts/Akira_Nakashima/vxyCyhfX">Nakashima Akira</a></td><td><a href="/facts/NEC/YnlUsMBA">NEC</a> engineer introduced <a href="/facts/Switching_circuit_theory/6ogJWSyx">switching circuit theory</a> in papers from 1934 to 1936, laying the foundations for <a href="/facts/Digital_circuit/vWgfC29C">digital circuit</a> design, in <a href="/facts/Digital_computer/SQe1aK05">digital computers</a> and other areas of modern technology.</td></tr><tr><td>1960</td><td><a href="/facts/Peter_Naur/S1X7AHfj">Naur, Peter</a></td><td>Edited the <a href="/facts/ALGOL_60/QnpxUYQm">ALGOL 60</a> Revised Report, introducing <a href="/facts/Backus-Naur_form/xbMXDntc">Backus-Naur form</a></td></tr><tr><td>1945</td><td><a href="/facts/John_von_Neumann/aUk6urof">Neumann, John von</a></td><td>Formulated the <a href="/facts/Von_Neumann_architecture/te0yulFa">von Neumann architecture</a> upon which most modern computers are based.</td></tr><tr><td>1956</td><td><a href="/facts/Allen_Newell/61yUQ647">Newell, Allen</a></td><td>Together with <a href="/facts/J._C._Shaw/HEKfD595">J. C. Shaw</a><a class="footnote-ref" id="fnref:48" href="#fn:48"><sup>48</sup></a> and Herbert Simon, the three co-wrote the Logic Theorist, the first true AI program, in the first list-processing language, which influenced LISP.</td></tr><tr><td>1943</td><td><a href="/facts/Max_Newman/dkdN0hQ8">Newman, Max</a></td><td>Instigated the production of the <a href="/facts/Colossus_computer/pbkHLPwp">Colossus computers</a> at <a href="/facts/Bletchley_Park/ID0B04WB">Bletchley Park</a>. After the second world war he established the <a href="/facts/Computing_Machine_Laboratory/8femH1Ib">Computing Machine Laboratory</a> at the <a href="/facts/University_of_Manchester/PwJzEj8h">University of Manchester</a> where he created the project that built the world's first <a href="/facts/Stored-program_computer/CwcIk5S8">stored-program computer</a>, the <a href="/facts/Manchester_Baby/tpkAwQnc">Manchester Baby</a>.</td></tr><tr><td>1962</td><td><a href="/facts/Kristen_Nygaard/2h3KoI8B">Nygaard, Kristen</a></td><td>With <a href="/facts/Ole-Johan_Dahl/4XzG0v9q">Ole-Johan Dahl</a>, invented the proto-object oriented language <a href="/facts/SIMULA/gaEVG7SL">SIMULA</a>.</td></tr><tr><td>1642</td><td><a href="/facts/Blaise_Pascal/Huy5LenL">Pascal, Blaise</a></td><td>Invented the <a href="/facts/Mechanical_calculator/As7HE5dB">mechanical calculator</a>.</td></tr><tr><td>5th century BCE</td><td><a href="/facts/P%25C4%2581%25E1%25B9%2587ini/C2brRvXB">Pāṇini</a></td><td>Invented first formal <a href="/facts/Grammar/vprQsHIR">Grammar</a>. Also gave early forms of <a href="/facts/Backus-Naur_form/xbMXDntc">Backus-Naur form</a><a class="footnote-ref" id="fnref:49" href="#fn:49"><sup>49</sup></a></td></tr><tr><td>2017</td><td><a href="/facts/David_Patterson_(computer_scientist)/rAulJF6m">Patterson, David</a></td><td>For pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry.</td></tr><tr><td>2011</td><td><a href="/facts/Judea_Pearl/J2JUSAfe">Pearl, Judea</a></td><td>Fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.<a class="footnote-ref" id="fnref:50" href="#fn:50"><sup>50</sup></a></td></tr><tr><td>1952</td><td><a href="/facts/Alan_Perlis/yKMjm7gP">Perlis, Alan</a></td><td>On <a href="/facts/Project_Whirlwind/IbG8pxYt">Project Whirlwind</a>, member of the team that developed the <a href="/facts/ALGOL_programming_language/wlFJGNEx">ALGOL programming language</a>, and the first recipient of the Turing Award</td></tr><tr><td>1985</td><td><a href="/facts/Radia_Perlman/Rdd8XHpq">Perlman, Radia</a></td><td>Invented the <a href="/facts/Spanning_Tree_Protocol/ofHHMBuM">Spanning Tree Protocol</a> (STP), which is fundamental to the operation of <a href="/facts/Network_bridge/5nyTQtNW">network bridges</a>, while working for <a href="/facts/Digital_Equipment_Corporation/ztxs6keA">Digital Equipment Corporation</a>. Has done extensive and innovative research, particularly on encryption and networking. She received the USENIX Lifetime Achievement Award in 2007, among numerous others.</td></tr><tr><td>1964</td><td><a href="/facts/Pier_Giorgio_Perotto/7U5l41fY">Perotto, Pier Giorgio</a>[<i>undue weight? – discuss</i>]</td><td>Computer designer for <a href="/facts/Olivetti/bdoq8XPH">Olivetti</a>, designed one of the first electronic <a href="/facts/Programmable_calculator/5UHx9nIg">programmable calculators</a>, the <a href="/facts/Programma_101/qzJN5YpA">Programma 101</a><a class="footnote-ref" id="fnref:51" href="#fn:51"><sup>51</sup></a><a class="footnote-ref" id="fnref:52" href="#fn:52"><sup>52</sup></a><a class="footnote-ref" id="fnref:53" href="#fn:53"><sup>53</sup></a></td></tr><tr><td>1932</td><td><a href="/facts/R%25C3%25B3zsa_P%25C3%25A9ter/rXPJ8Waw">Péter, Rózsa</a></td><td>Published a series of papers grounding <a href="/facts/Recursion_theory/cqDfXwdf">recursion theory</a> as a separate area of mathematical research, setting the foundation for theoretical computer science.</td></tr><tr><td>1995</td><td><a href="/facts/Rosalind_Picard/waHPtruY">Picard, Rosalind</a> [<i>undue weight? – discuss</i>]</td><td>Founded <a href="/facts/Affective_Computing/blEnsJcx">Affective Computing</a>, and laid the foundations for giving computers skills of emotional intelligence.</td></tr><tr><td>1996</td><td><a href="/facts/Amir_Pnueli/qJ7mMEXm">Pnueli, Amir</a></td><td>Introducing <a href="/facts/Temporal_logic/vANP39lc">temporal logic</a> into computing science and for outstanding contributions to program and systems <a href="/facts/Formal_verification/BYD4GnJR">verification</a>.<a class="footnote-ref" id="fnref:54" href="#fn:54"><sup>54</sup></a></td></tr><tr><td>1936</td><td><a href="/facts/Emil_Leon_Post/Hl2CKCxw">Post, Emil L.</a></td><td>Developed the <a href="/facts/Post%25E2%2580%2593Turing_machine/neqsP142">Post machine</a> as a model of computation, independently of Turing. Known also for developing <a href="/facts/Truth_tables/4KsmArDW">truth tables</a>, the <a href="/facts/Post_correspondence_problem/YjHh66CM">Post correspondence problem</a> used in recursion theory as well as proving what is known as <a href="/facts/Post%2527s_theorem/wPId3E7D">Post's theorem</a>.</td></tr><tr><td>1976</td><td><a href="/facts/Michael_O._Rabin/M6NHIb5J">Rabin, Michael O.</a></td><td>The joint paper "Finite Automata and Their Decision Problems",<a class="footnote-ref" id="fnref:55" href="#fn:55"><sup>55</sup></a> which introduced the idea of <a href="/facts/Nondeterministic_machine/fW600oAl">nondeterministic machines</a>, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.<a class="footnote-ref" id="fnref:56" href="#fn:56"><sup>56</sup></a><a class="footnote-ref" id="fnref:57" href="#fn:57"><sup>57</sup></a></td></tr><tr><td>1994</td><td><a href="/facts/Raj_Reddy/1P1PW5rw">Reddy, Raj</a></td><td>Pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology.<a class="footnote-ref" id="fnref:58" href="#fn:58"><sup>58</sup></a></td></tr><tr><td>1967–2011</td><td><a href="/facts/Dennis_Ritchie/I1yu1UWU">Ritchie, Dennis</a></td><td>With <a href="/facts/Ken_Thompson/KQtrw9YM">Ken Thompson</a>, pioneered the <a href="/facts/C_(programming_language)/Ky2No763">C programming language</a> and the <a href="/facts/Unix/0pNL2seI">Unix</a> computer operating system at Bell Labs.</td></tr><tr><td>1977</td><td><a href="/facts/Ron_Rivest/nQsIcAKa">Rivest, Ron</a></td><td><a href="/facts/RSA_(algorithm)/XTzyfHuq">Ingenious contribution</a> and making <a href="/facts/Public-key_cryptography/gowoFTxS">public-key cryptography</a> useful in practice.</td></tr><tr><td>1958–1960</td><td><a href="/facts/Saul_Rosen/t4RXcKFh">Rosen, Saul</a></td><td>Designed the software of the first transistor-based computer. Also influenced the ALGOL programming language.</td></tr><tr><td>1975, 1985</td><td><a href="/facts/Philip_Rubin/4JGaFBx3">Rubin, Philip</a></td><td>Developed pioneering computational <a href="/facts/Speech_synthesis/ceTczTv9">speech synthesis</a> systems for use in the experimental study of speech perception and production, including <a href="/facts/Articulatory_synthesis/mUrUf8jR">articulatory synthesis</a> and <a href="/facts/Sinewave_synthesis/m1E5IHHr">sinewave synthesis</a>. Also designed the <a href="/facts/HADES_(software)/2SCt4ERH">HADES</a> signal processing system, a predecessor of <a href="/facts/MATLAB/qPjLISCk">MATLAB</a>.</td></tr><tr><td>1910</td><td><a href="/facts/Bertrand_Russell/SRpwNX2U">Russell, Bertrand</a></td><td>Made contributions to computer science with his work on <a href="/facts/Mathematical_logic/SaI7Y3wN">mathematical logic</a> (example: <a href="/facts/Truth_function/aH5kBhQ7">truth function</a>). Introduced the notion of <a href="/facts/Type_theory/xj0xzVqI">type theory</a>. He also introduced <a href="/facts/Type_system/Tz0bAMS9">type system</a> (along with <a href="/facts/Alfred_North_Whitehead/7KuylmP3">Alfred North Whitehead</a>) in his work, <a href="/facts/Principia_Mathematica/7ufeceV4">Principia Mathematica</a>.</td></tr><tr><td>1975</td><td><a href="/facts/Gerard_Salton/K9dbA2dN">Salton, Gerard</a>[<i>undue weight? – discuss</i>]</td><td>A pioneer of automatic <a href="/facts/Information_retrieval/MFSmpeNw">information retrieval</a>, who proposed the <a href="/facts/Vector_space_model/WC1LqLA5">vector space model</a> and the <a href="/facts/Inverted_index/Kyva3prq">inverted index</a>.</td></tr><tr><td>1962</td><td><a href="/facts/Jean_E._Sammet/cYLAq0M4">Sammet, Jean E.</a></td><td>Developed the <a href="/facts/FORMAC_programming_language/jEVUddGx">FORMAC programming language</a>. She was also the first to write extensively about the history and categorization of programming languages in 1969, and became the first female president of the <a href="/facts/Association_for_Computing_Machinery/abI2atlP">Association for Computing Machinery</a> in 1974.</td></tr><tr><td>1880, 1898</td><td><a href="/facts/Charles_Sanders_Peirce/z76dNqhM">Sanders Peirce, Charles</a></td><td>Proved the <a href="/facts/Functional_completeness/ncyHAsHH">functional completeness</a> of the <a href="/facts/NOR_gate/3l3MqaMI">NOR gate</a>. Proposed the implementation of logic via electrical circuits, decades before <a href="/facts/Claude_Shannon/EremsCws">Claude Shannon</a>. Extended Aristotelian logic with <a href="/facts/First-order_predicate_calculus/lcISqWIg">first-order predicate calculus</a>, independently of <a href="/facts/Gottlob_Frege/FXyStVYj">Gottlob Frege</a>, a crucial precursor in <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a>. Also relevant to early work on <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>, <a href="/facts/Logic_programming/Xgh8lj3F">logic programming</a>.</td></tr><tr><td>1976</td><td><a href="/facts/Dana_Scott/XEVddlVg">Scott, Dana</a></td><td>The joint paper "Finite Automata and Their Decision Problems",<a class="footnote-ref" id="fnref:59" href="#fn:59"><sup>59</sup></a> which introduced the idea of <a href="/facts/Nondeterministic_machine/fW600oAl">nondeterministic machines</a>, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.<a class="footnote-ref" id="fnref:60" href="#fn:60"><sup>60</sup></a><a class="footnote-ref" id="fnref:61" href="#fn:61"><sup>61</sup></a></td></tr><tr><td>1977</td><td><a href="/facts/Adi_Shamir/CTnaUeP6">Shamir, Adi</a></td><td><a href="/facts/RSA_(algorithm)/XTzyfHuq">Ingenious contribution</a> and making <a href="/facts/Public-key_cryptography/gowoFTxS">public-key cryptography</a> useful in practice.</td></tr><tr><td>1937, 1948</td><td><a href="/facts/Claude_E._Shannon/EremsCws">Shannon, Claude</a></td><td>Founded <a href="/facts/Information_theory/qNLH3U5P">information theory</a>, and laid foundations for practical digital circuit design.</td></tr><tr><td>1971</td><td><a href="/facts/Masatoshi_Shima/H83xJqVQ">Shima Masatoshi</a></td><td>Designed the <a href="/facts/Intel_4004/kAoetjSU">Intel 4004</a>, the first commercial <a href="/facts/Microprocessor/Fx9CaQht">microprocessor</a>,<a class="footnote-ref" id="fnref:62" href="#fn:62"><sup>62</sup></a><a class="footnote-ref" id="fnref:63" href="#fn:63"><sup>63</sup></a> as well as the <a href="/facts/Intel_8080/32FvNTcD">Intel 8080</a>, <a href="/facts/Zilog_Z80/Jeqe2h55">Zilog Z80</a> and <a href="/facts/Zilog_Z8000/do1uTklA">Zilog Z8000</a> microprocessors, and the <a href="/facts/Intel_8259/Y5FhqM6G">Intel 8259</a>, <a href="/facts/8255/JAIeF77r">8255</a>, <a href="/facts/8253/ywrfGhlk">8253</a>, <a href="/facts/Intel_8257/dBE1nzCB">8257</a> and <a href="/facts/8251/RtmTs4sv">8251</a> chips.<a class="footnote-ref" id="fnref:64" href="#fn:64"><sup>64</sup></a></td></tr><tr><td>1997 to 1999</td><td><a href="/facts/Neil_Siegel/3G7dMe2A">Siegel, Neil</a></td><td>He is the documented earliest creator of a complete, operating adaptation of the internet to fully-routed wireless operation, and many important / related technologies that are widely used today in such wireless devices. <a href="/facts/Neil_Siegel/3G7dMe2A">wireless internet</a></td></tr><tr><td>2007</td><td><a href="/facts/Joseph_Sifakis/WA4GpWky">Sifakis, Joseph</a></td><td>Developing <a href="/facts/Model_checking/FwvKMlw9">model checking</a> into a highly effective verification technology, widely adopted in the hardware and software industries.<a class="footnote-ref" id="fnref:65" href="#fn:65"><sup>65</sup></a></td></tr><tr><td>1956, 1957</td><td><a href="/facts/Herbert_A._Simon/NNHhQ2bS">Simon, Herbert A.</a></td><td>A political scientist and economist who pioneered <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>. Co-creator of the <a href="/facts/Logic_Theory_Machine/cCCDAyCq">Logic Theory Machine</a> and the <a href="/facts/General_Problem_Solver/r0lMBqR7">General Problem Solver</a> programs.</td></tr><tr><td>1953</td><td><a href="/facts/Karen_Sp%25C3%25A4rck_Jones/NLFBuKaf">Spärck Jones, Karen</a> [<i>undue weight? – discuss</i>]</td><td>One of the pioneers of <a href="/facts/Information_retrieval/MFSmpeNw">information retrieval</a> and <a href="/facts/Natural_language_processing/1hjMKsSN">natural language processing</a>.</td></tr><tr><td>1972</td><td><a href="/facts/Richard_Stallman/hhoPN0Mw">Stallman, Richard</a></td><td>Stallman launched the <a href="/facts/GNU_Project/mjc8AwM6">GNU Project</a> in September 1983 to create a Unix-like computer operating system composed entirely of free software. With this, he also launched the <a href="/facts/Free_software_movement/aLlvF4D4">free software movement</a>.</td></tr><tr><td>1993</td><td><a href="/facts/Richard_E._Stearns/gAuumqUM">Stearns, Richard E.</a></td><td>Foundations for the field of <a href="/facts/Computational_complexity_theory/etHuVF3U">computational complexity theory</a>.<a class="footnote-ref" id="fnref:66" href="#fn:66"><sup>66</sup></a></td></tr><tr><td>1981</td><td><a href="/facts/Alexander_Stepanov/znVUvH2I">Stepanov, Alexander</a></td><td>Stepanov is one of the pioneers when it comes to Generic Programming and he is also the primary designer and implementer of the <a href="/facts/C%252B%252B/Et0F2qn9">C++</a> <a href="/facts/Standard_Template_Library/IxqpRzWU">Standard Template Library</a>.</td></tr><tr><td>1937, 1941</td><td><a href="/facts/George_Robert_Stibitz/M6pUBsqx">Stibitz, George R.</a></td><td>Father of modern digital computing and <a href="/facts/Remote_job_entry/x0usMfke">remote job entry</a>. Coined the term "digital". Discovered the reflected binary code known as <a href="/facts/Gray_code/HtbVlM7T">Gray code</a>. Excess-3 code is named after him as well (<a href="/facts/Stibitz_code/shAvgBtQ">Stibitz code</a>).</td></tr><tr><td>1982</td><td><a href="/facts/Michael_Stonebraker/XevuvaKt">Stonebraker, Michael</a></td><td>Revolutionized the field of database management systems (DBMSs) and founded multiple successful database companies</td></tr><tr><td>1979</td><td><a href="/facts/Bjarne_Stroustrup/Be1Yq6rn">Stroustrup, Bjarne</a></td><td>Invented <a href="/facts/C%252B%252B/Et0F2qn9">C++</a> at Bell Labs</td></tr><tr><td>1963</td><td><a href="/facts/Ivan_Sutherland/HDVqMT9h">Sutherland, Ivan</a></td><td>Author of <a href="/facts/Sketchpad/BNAoP4Gp">Sketchpad</a>, the ancestor of modern computer-aided drafting (CAD) programs and one of the early examples of <a href="/facts/Object-oriented_programming/TxNMEcao">object-oriented programming</a>.</td></tr><tr><td>1986</td><td><a href="/facts/Robert_Tarjan/kn1pMCN0">Tarjan, Robert</a></td><td>Fundamental achievements in the design and analysis of algorithms and data structures.</td></tr><tr><td>1973</td><td><a href="/facts/Charles_P._Thacker/EAr800bP">Thacker, Charles P.</a></td><td>Pioneering design and realization of the <a href="/facts/Xerox_Alto/6pjFTD0A">Xerox Alto</a>, the first modern personal computer, and in addition for his contributions to the Ethernet and the Tablet PC.</td></tr><tr><td>1972, 1973</td><td><a href="/facts/Andr%25C3%25A9_Truong_Trong_Thi/BBNToLy5">Thi, André Truong Trong</a> and <a href="/facts/Fran%25C3%25A7ois_Gernelle/ynSvMn4C">François Gernelle</a>[<i>undue weight? – discuss</i>]</td><td>Invention of the <a href="/facts/Micral/ea4gU5be">Micral N</a>, the earliest commercial, non-kit personal computer based on a <a href="/facts/Microprocessor/Fx9CaQht">microprocessor</a>.</td></tr><tr><td>1967</td><td><a href="/facts/Ken_Thompson/KQtrw9YM">Thompson, Ken</a></td><td>Created the <a href="/facts/Unix/0pNL2seI">Unix</a> operating system, the <a href="/facts/B_programming_language/b9n2WoNN">B programming language</a>, <a href="/facts/Plan_9_from_Bell_Labs/pQjPlS7w">Plan 9</a> operating system, the first machine to achieve a Master rating in chess, and the <a href="/facts/UTF-8/xlaVHSyf">UTF-8</a> encoding at Bell Labs and the <a href="/facts/Go_programming_language/oWlsmAFJ">Go programming language</a> at Google.</td></tr><tr><td>1993</td><td><a href="/facts/Chai_Keong_Toh/KWXwo5Ru">Toh, Chai Keong</a></td><td>Created mobile ad hoc networking; Implemented the first working wireless ad hoc network of laptop computers in 1998 using Linux OS, Lucent WaveLan 802.11 radios, and a new distributed routing protocol transparent to TCP/UDP/IP.</td></tr><tr><td>1912, 1914</td><td><a href="/facts/Leonardo_Torres_Quevedo/59LagmRR">Torres Quevedo, Leonardo</a></td><td>In 1912, Leonardo Torres Quevedo built <a href="/facts/El_Ajedrecista/3SBFTjRh">El Ajedrecista</a> (<i>the chess player</i>), one of the first autonomous machines capable of playing chess. As opposed to the human-operated <a href="/facts/Mechanical_Turk/gGk2NnuL">The Turk</a> and <a href="/facts/Ajeeb/c4njEalX">Ajeeb</a>, El Ajedrecista was a true automaton built to play chess without human guidance. It played an endgame with three chess pieces, automatically moving a white king and a rook to checkmate the black king moved by a human opponent. In his work <i>Essays on Automatics</i>, published in 1914, Torres Quevedo formulates what will be a new branch of engineering: <a href="/facts/Automation/3YlF2K5q">automation</a> and designed an electromechanical version of Babbage's Analytical engine which introduced <a href="/facts/Floating-point_arithmetic/eIckahxe">floating-point arithmetic</a>.</td></tr><tr><td>1991</td><td><a href="/facts/Linus_Torvalds/EdDKP534">Torvalds, Linus</a></td><td>Created the first version of the <a href="/facts/Linux_kernel/dlkduHuA">Linux kernel</a>.</td></tr><tr><td>1965</td><td><a href="/facts/John_W._Tukey/2a5FbPWb">Tukey, John W.</a></td><td>With <a href="/facts/James_Cooley/zy3vmXBQ">James Cooley</a>, created the <a href="/facts/Cooley-Tukey_FFT_algorithm/03VB7JrC">fast Fourier transform</a>. He invented the term "bit".<a class="footnote-ref" id="fnref:67" href="#fn:67"><sup>67</sup></a></td></tr><tr><td>1936</td><td><a href="/facts/Alan_Turing/klov9b6g">Turing, Alan</a></td><td>Made several fundamental contributions to theoretical computer science, including the <a href="/facts/Turing_machine/ojCtglYu">Turing machine</a> computational model, the conceiving of the stored program concept and the designing of the high-speed <a href="/facts/Automatic_Computing_Engine/ouFXNzJS">ACE</a> design. Independently of <a href="/facts/Alonzo_Church/b7D52Itv">Alonzo Church</a>, he formulated the <a href="/facts/Church-Turing_thesis/hDHn641f">Church-Turing thesis</a> and proved that <a href="/facts/First-order_logic/lcISqWIg">first-order logic</a> is <a href="/facts/Entscheidungsproblem/y8LDal2X">undecidable</a>. He also explored the philosophical issues concerning <a href="/facts/Artificial_Intelligence/lJGauQwX">artificial intelligence</a>, proposing what is now known as <a href="/facts/Turing_test/wEvf9DIr">Turing test</a>.</td></tr><tr><td>2010</td><td><a href="/facts/Leslie_Valiant/hA5okAxL">Valiant, Leslie</a></td><td>Transformative contributions to the <a href="/facts/Theory_of_computation/xYJd2YeI">theory of computation</a>, including the theory of probably approximately correct (<a href="/facts/Probably_approximately_correct_learning/vBQlvDV1">PAC</a>) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.</td></tr><tr><td>1875, 1875</td><td><a href="/facts/Ram%25C3%25B3n_Verea/x34UoLpk">Verea, Ramón</a></td><td>Designed and patented the Verea Direct Multiplier, the first mechanical direct multiplier.</td></tr><tr><td>1950~</td><td><a href="/facts/An_Wang/CAtcP1ju">Wang An</a></td><td>Made key contributions to the development of <a href="/facts/Magnetic_core/yojywmuo">magnetic core</a> memory.</td></tr><tr><td>1955, 1960s, 1974</td><td><a href="/facts/Willis_Ware/6puUAVzp">Ware, Willis</a></td><td>Co-designer of <a href="/facts/JOHNNIAC/vbRP6Krz">JOHNNIAC</a>. Chaired committee that developed the <a href="/facts/FTC_Fair_Information_Practice/A4HcvYKh">Code of Fair Information Practice</a> and led to the <a href="/facts/Privacy_Act_of_1974/fDgb3TJl">Privacy Act of 1974</a>. Vice-chair of the Privacy Protection Study Commission.</td></tr><tr><td>1964, 1966</td><td><a href="/facts/Joseph_Weizenbaum/Sy2f7I4h">Weizenbaum, Joseph</a></td><td>One of the fathers of modern <a href="/facts/Artificial_intelligence/lJGauQwX">artificial intelligence</a>. Creator of the <a href="/facts/ELIZA/e2Frdz7f">ELIZA</a> program using <a href="/facts/Natural_language_processing/1hjMKsSN">natural language processing</a> to emulate conversations with a <a href="/facts/Psychologist/J4l4QdX2">psychologist</a>.</td></tr><tr><td>1968</td><td><a href="/facts/Adriaan_van_Wijngaarden/vobXnR7n">Wijngaarden, Adriaan van</a></td><td>Developer of the <a href="/facts/W-grammar/YkMRSh4u">W-grammar</a> first used in the definition of <a href="/facts/ALGOL_68/NTnc9fy7">ALGOL 68</a></td></tr><tr><td>1949</td><td><a href="/facts/Maurice_Wilkes/2RJ58EKc">Wilkes, Maurice</a></td><td>Built the first practical <a href="/facts/Stored_program/CwcIk5S8">stored program</a> computer (<a href="/facts/EDSAC/nyK6xJ7B">EDSAC</a>) to be completed and for being credited with the ideas of several high-level programming language constructs.</td></tr><tr><td>1970</td><td><a href="/facts/James_H._Wilkinson/4aKUNcrg">Wilkinson, James H.</a></td><td>Research in <a href="/facts/Numerical_analysis/QT9cYa9z">numerical analysis</a> to facilitate the use of the high-speed digital computer, having received special recognition for his work in computations in <a href="/facts/Linear_algebra/8VaB4VWk">linear algebra</a> and "backward" error analysis.<a class="footnote-ref" id="fnref:68" href="#fn:68"><sup>68</sup></a></td></tr><tr><td>1970, 1978</td><td><a href="/facts/Niklaus_Wirth/krsLUB11">Wirth, Niklaus</a></td><td>Designed the <a href="/facts/Pascal_(programming_language)/b3yvp8bF">Pascal</a>, <a href="/facts/Modula-2/DFyUTdAq">Modula-2</a> and <a href="/facts/Oberon_(programming_language)/YHFyy3UU">Oberon</a> programming languages.</td></tr><tr><td>2000</td><td><a href="/facts/Andrew_Yao/F5AHrY0e">Yao, Andrew</a></td><td>Fundamental contributions to the <a href="/facts/Theory_of_computation/xYJd2YeI">theory of computation</a>, including the complexity-based theory of <a href="/facts/Pseudorandom_number_generator/sIrCxIBq">pseudorandom number generation</a>, <a href="/facts/Cryptography/e94PEVau">cryptography</a>, and <a href="/facts/Communication_complexity/TXLhEfQW">communication complexity</a>.</td></tr><tr><td>1955–1958</td><td><a href="/facts/Heinz_Zemanek/nAx4DdaV">Zemanek, Heinz</a></td><td>Developed an early fully transistorized computer, the <a href="/facts/Mail%25C3%25BCfterl/UCmK1cWG">Mailüfterl</a>. Crucial in the creation of the formal definition of the programming language <a href="/facts/PL%2fI/469mVYgd">PL/I</a>.</td></tr><tr><td>1938, 1945</td><td><a href="/facts/Konrad_Zuse/yrvbaEg3">Zuse, Konrad</a></td><td>Built the first digital freely programmable computer, the <a href="/facts/Z1_(computer)/LDe34zlW">Z1</a>. Built the first functional program-controlled computer, the <a href="/facts/Z3_(computer)/JNPXGqDp">Z3</a> in 1941.<a class="footnote-ref" id="fnref:69" href="#fn:69"><sup>69</sup></a> The Z3 already used what later became known as <a href="/facts/Reverse_Polish_Notation/a6rDoJ7X">Reverse Polish Notation</a>, and it was proven to be Turing-complete in 1998. Produced the world's first commercial computer, the <a href="/facts/Z4_(computer)/RNjK5G7f">Z4</a>. Designed the first high-level programming language, <a href="/facts/Plankalk%25C3%25BCl/eqA4RGcF">Plankalkül</a>.</td></tr></tbody></table> <p>~ Items marked with a tilde are circa dates. </p> <h2 id="see-also">See also</h2> <ul> <li>Biography portal</li><li>Lists portal</li></ul> <ul><li><a href="/facts/Computer_Pioneer_Award/9PKCGf5W">Computer Pioneer Award</a></li> <li><a href="/facts/IEEE_John_von_Neumann_Medal/eABth7GF">IEEE John von Neumann Medal</a></li> <li><a href="/facts/Grace_Murray_Hopper_Award/QWm4lPuk">Grace Murray Hopper Award</a></li> <li><a href="/facts/History_of_computing/MLKvPoqn">History of computing</a> <ul><li><a href="/facts/History_of_computing_hardware/83xXSmuW">History of computing hardware</a></li> <li><a href="/facts/History_of_computing_hardware_(1960s%25E2%2580%2593present)/Eq0nC7aD">History of computing hardware (1960s–present)</a></li> <li><a href="/facts/History_of_software/MpDlQUEr">History of software</a></li></ul></li> <li><a href="/facts/List_of_computer_science_awards/WeVUHhBs">List of computer science awards</a></li> <li><a href="/facts/List_of_computer_scientists/zd2xpuxp">List of computer scientists</a></li> <li><a href="/facts/List_of_Internet_pioneers/0d1bt83h">List of Internet pioneers</a></li> <li><a href="/facts/List_of_people_considered_father_or_mother_of_a_field/7QuPb8XF">List of people considered father or mother of a field § Computing</a></li> <li><i><a href="/facts/The_Man_Who_Invented_the_Computer/jRFVGhGY">The Man Who Invented the Computer</a></i> (2010 book)</li> <li><a href="/facts/List_of_Russian_IT_developers/U2sLP1aW">List of Russian IT developers</a></li> <li><a href="/facts/List_of_Women_in_Technology_International_Hall_of_Fame_inductees/2AuUdITk">List of Women in Technology International Hall of Fame inductees</a></li> <li><a href="/facts/Timeline_of_computing/bEcQv72r">Timeline of computing</a></li> <li><a href="/facts/Turing_Award/HbEEp0GF">Turing Award</a></li> <li><a href="/facts/Women_in_computing/TnhJ4EbQ">Women in computing</a></li></ul> <h3>Sources</h3> <ul><li>Hamming, Richard W. (1950). <a href="https://web.archive.org/web/20060525060427/http://www.caip.rutgers.edu/~bushnell/dsdwebsite/hamming.pdf">"Error detecting and error correcting codes"</a> (PDF). <i><a href="/facts/Bell_System_Technical_Journal/JjXNS5y1">Bell System Technical Journal</a></i>. 29 (2): 147–160. <a href="/facts/Doi_(identifier)/muM9Etpq">doi</a>:<a href="https://doi.org/10.1002%2Fj.1538-7305.1950.tb00463.x">10.1002/j.1538-7305.1950.tb00463.x</a>. <a href="/facts/MR_(identifier)/uP137L11">MR</a> <a href="https://mathscinet.ams.org/mathscinet-getitem?mr=0035935">0035935</a>. <a href="/facts/S2CID_(identifier)/ldJsHa2Y">S2CID</a> <a href="https://api.semanticscholar.org/CorpusID:61141773">61141773</a>. Archived from <a href="http://www.caip.rutgers.edu/~bushnell/dsdwebsite/hamming.pdf">the original</a> (PDF) on 2006-05-25.</li> <li>Ling, San; Xing, Chaoping (2004). <i>Coding Theory: a First Course</i>. Cambridge: Cambridge University Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-521-82191-9.</li> <li><a href="/facts/Vera_Pless/na9l860I">Pless, Vera</a> (1982). <a href="/facts/Introduction_to_the_Theory_of_Error-Correcting_Codes/VKWbax0T"><i>Introduction to the Theory of Error-Correcting Codes</i></a>. New York: Wiley. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-471-08684-0.</li> <li>Morgan, Samuel P. (September 1998). <a href="https://www.ams.org/notices/199808/mem-morgan.pdf">"Richard Wesley Hamming (1915–1998)"</a> (PDF). <i>Notices of the AMS</i>. 45 (8): 972–977. <a href="/facts/ISSN_(identifier)/DPAflDvU">ISSN</a> <a href="https://search.worldcat.org/issn/0002-9920">0002-9920</a>. Retrieved 2014-08-30.</li></ul> <h2 id="external-links">External links</h2> <ul><li><a href="http://www.ibiblio.org/pioneers/">Internet pioneers</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Mario Tokoro, ed. (2010). "9". e: From Understanding Principles to Solving Problems. IOS Press. pp. 223–224. ISBN 978-1-60750-468-9. <a href="978-1-60750-468-9" target="_blank">978-1-60750-468-9</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Cristopher Moore; Stephan Mertens (2011). The Nature of Computation. Oxford University Press. p. 36. ISBN 978-0-19-162080-5. <a href="978-0-19-162080-5" target="_blank">978-0-19-162080-5</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>A. P. Ershov, Donald Ervin Knuth, ed. (1981). Algorithms in modern mathematics and computer science: proceedings, Urgench, Uzbek SSR, 16–22 September 1979. Springer. ISBN 978-3-540-11157-3. <a href="978-3-540-11157-3" target="_blank">978-3-540-11157-3</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>"UW Alum Dr. Gene Amdahl, Pioneer of Mainframe Computing, Dies at 92". Department of Physics. 2015-11-12. Retrieved 2024-09-20. <a href="https://www.physics.wisc.edu/2015/11/12/uw-alum-dr-gene-amdahl-pioneer-of-mainframe-computing-dies-at-92/" target="_blank">https://www.physics.wisc.edu/2015/11/12/uw-alum-dr-gene-amdahl-pioneer-of-mainframe-computing-dies-at-92/</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"The IBM System/360 | IBM". www.ibm.com. Retrieved 2024-09-20. <a href="https://www.ibm.com/history/system-360" target="_blank">https://www.ibm.com/history/system-360</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>"GENE M. AMDAHL 1922–2015". NAE Website. National Academy of Engineering. Retrieved 2024-09-20. <a href="https://www.nae.edu/219733/GENE-M-AMDAHL-19222015" target="_blank">https://www.nae.edu/219733/GENE-M-AMDAHL-19222015</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>Bachman, C. W. (1973). "The programmer as navigator". Communications of the ACM. 16 (11): 653–658. doi:10.1145/355611.362534. <a href="https://doi.org/10.1145%2F355611.362534" target="_blank">https://doi.org/10.1145%2F355611.362534</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Koetsier, Teun (2001). "On the prehistory of programmable machines: musical automata, looms, calculators". Mechanism and Machine Theory. 36 (5): 589–603. doi:10.1016/S0094-114X(01)00005-2. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"The real story of how the Internet became so vulnerable". Washington Post. 2015-05-30. Archived from the original on 2015-05-30. Retrieved 2020-02-18. Historians credit seminal insights to Welsh scientist Donald W. Davies and American engineer Paul Baran <a href="https://web.archive.org/web/20150530231409/http://www.washingtonpost.com/sf/business/2015/05/30/net-of-insecurity-part-1/" target="_blank">https://web.archive.org/web/20150530231409/http://www.washingtonpost.com/sf/business/2015/05/30/net-of-insecurity-part-1/</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>"Inductee Details - Paul Baran". National Inventors Hall of Fame. Archived from the original on 2017-09-06. Retrieved 2017-09-06. <a href="https://web.archive.org/web/20170906091231/http://www.invent.org/honor/inductees/inductee-detail/?IID=316" target="_blank">https://web.archive.org/web/20170906091231/http://www.invent.org/honor/inductees/inductee-detail/?IID=316</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Baran, Paul (2002). "The beginnings of packet switching: some underlying concepts" (PDF). IEEE Communications Magazine. 40 (7): 42–48. doi:10.1109/MCOM.2002.1018006. ISSN 0163-6804. Essentially all the work was defined by 1961, and fleshed out and put into formal written form in 1962. The idea of hot potato routing dates from late 1960. <a href="http://web.cs.ucla.edu/~lixia/papers/Baran2002.pdf" target="_blank">http://web.cs.ucla.edu/~lixia/papers/Baran2002.pdf</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Monica, 1776 Main Street Santa; California 90401-3208. "Paul Baran and the Origins of the Internet". www.rand.org. Retrieved 2020-02-15.{{cite web}}: CS1 maint: numeric names: authors list (link) <a href="https://www.rand.org/about/history/baran.html" target="_blank">https://www.rand.org/about/history/baran.html</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>"Jean-Maurice- Emile Baudot. Système de télégraphie rapide, June 1874. Brevet 103,898; Source: Archives Institut National de la Propriété Industrielle (INPI)". Archived from the original on 2017-12-16. Retrieved 2019-07-21. <a href="https://web.archive.org/web/20171216144029/http://leoferres.info/images/baudot_cp1874.jpg" target="_blank">https://web.archive.org/web/20171216144029/http://leoferres.info/images/baudot_cp1874.jpg</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>Fathers of the Deep Learning Revolution Receive ACM A.M. Turing Award <a href="https://www.acm.org/media-center/2019/march/turing-award-2018" target="_blank">https://www.acm.org/media-center/2019/march/turing-award-2018</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>McPherson, Stephanie Sammartino (2009-09-01). Tim Berners-Lee: Inventor of the World Wide Web. Twenty-First Century Books. ISBN 978-0-8225-7273-2. <a href="978-0-8225-7273-2" target="_blank">978-0-8225-7273-2</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> <li id="fn:16"><p>"A.M. Turing Award Laureate – Manuel Blum". amturing.acm.org. Retrieved 2018-11-04. <a href="https://amturing.acm.org/award_winners/blum_4659082.cfm" target="_blank">https://amturing.acm.org/award_winners/blum_4659082.cfm</a> <a href="#fnref:16" class="footnote-back-ref">↩</a></p></li> <li id="fn:17"><p>"Per Brinch Hansen • IEEE Computer Society". Computer.org. Retrieved 2015-12-15. <a href="http://www.computer.org/web/awards/pioneer-per-hansen" target="_blank">http://www.computer.org/web/awards/pioneer-per-hansen</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></p></li> <li id="fn:18"><p>Brinch Hansen, Per (April 1993). "Monitors and Concurrent Pascal: a personal history" (PDF). 2nd ACM Conference on the History of Programming Languages. <a href="http://brinch-hansen.net/papers/1993a.pdf" target="_blank">http://brinch-hansen.net/papers/1993a.pdf</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></p></li> <li id="fn:19"><p>"Per Brinch Hansen • IEEE Computer Society". Computer.org. Retrieved 2015-12-15. <a href="http://www.computer.org/web/awards/pioneer-per-hansen" target="_blank">http://www.computer.org/web/awards/pioneer-per-hansen</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></p></li> <li id="fn:20"><p>Brinch Hansen, Per (November 1978). "Distributed processes: a concurrent programming concept" (PDF). Communications of the ACM. 21 (11): 934–941. CiteSeerX 10.1.1.107.3108. doi:10.1145/359642.359651. S2CID 11610744. <a href="http://brinch-hansen.net/papers/1978a.pdf" target="_blank">http://brinch-hansen.net/papers/1978a.pdf</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></p></li> <li id="fn:21"><p>"The real story of how the Internet became so vulnerable". Washington Post. 2015-05-30. Archived from the original on 2015-05-30. Retrieved 2020-02-18. Historians credit seminal insights to Welsh scientist Donald W. Davies and American engineer Paul Baran <a href="https://web.archive.org/web/20150530231409/http://www.washingtonpost.com/sf/business/2015/05/30/net-of-insecurity-part-1/" target="_blank">https://web.archive.org/web/20150530231409/http://www.washingtonpost.com/sf/business/2015/05/30/net-of-insecurity-part-1/</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></p></li> <li id="fn:22"><p>"Inductee Details - Donald Watts Davies". National Inventors Hall of Fame. Archived from the original on 2017-09-06. Retrieved 2017-09-06. <a href="https://web.archive.org/web/20170906091936/http://www.invent.org/honor/inductees/inductee-detail/?IID=328" target="_blank">https://web.archive.org/web/20170906091936/http://www.invent.org/honor/inductees/inductee-detail/?IID=328</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></p></li> <li id="fn:23"><p>Roberts, Dr. Lawrence G. (November 1978). "The Evolution of Packet Switching". Archived from the original on 2016-03-24. Retrieved 2017-09-05. Almost immediately after the 1965 meeting, Donald Davies conceived of the details of a store-and-forward packet switching system; Roberts, Dr. Lawrence G. (May 1995). "The ARPANET & Computer Networks". Archived from the original on 2016-03-24. Retrieved 2016-04-13. Then in June 1966, Davies wrote a second internal paper, "Proposal for a Digital Communication Network" In which he coined the word packet,- a small sub part of the message the user wants to send, and also introduced the concept of an "Interface computer" to sit between the user equipment and the packet network. <a href="https://web.archive.org/web/20160324033133/http://www.packet.cc/files/ev-packet-sw.html" target="_blank">https://web.archive.org/web/20160324033133/http://www.packet.cc/files/ev-packet-sw.html</a> <a href="#fnref:23" class="footnote-back-ref">↩</a></p></li> <li id="fn:24"><p>Donald Davies (2001), "A Historical Study of the Beginnings of Packet Switching", Computer Journal, British Computer Society[dead link] <a href="http://comjnl.oxfordjournals.org/content/44/3/152.extract" target="_blank">http://comjnl.oxfordjournals.org/content/44/3/152.extract</a> <a href="#fnref:24" class="footnote-back-ref">↩</a></p></li> <li id="fn:25"><p>Roberts, Dr. Lawrence G. (November 1978). "The Evolution of Packet Switching" (PDF). IEEE Invited Paper. Archived from the original (PDF) on 2018-12-31. Retrieved 2017-09-17. In nearly all respects, Davies' original proposal, developed in late 1965, was similar to the actual networks being built today. <a href="https://web.archive.org/web/20181231092936/http://www.ismlab.usf.edu/dcom/Ch10_Roberts_EvolutionPacketSwitching_IEEE_1978.pdf" target="_blank">https://web.archive.org/web/20181231092936/http://www.ismlab.usf.edu/dcom/Ch10_Roberts_EvolutionPacketSwitching_IEEE_1978.pdf</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></p></li> <li id="fn:26"><p>Diffie, W.; Hellman, M. (1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. CiteSeerX 10.1.1.37.9720. doi:10.1109/TIT.1976.1055638. <a href="https://www-ee.stanford.edu/~hellman/publications/24.pdf" target="_blank">https://www-ee.stanford.edu/~hellman/publications/24.pdf</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></p></li> <li id="fn:27"><p>"Cryptography Pioneers Receive 2015 ACM A.M. Turing Award". ACM. <a href="http://amturing.acm.org/award_winners/diffie_8371646.cfm" target="_blank">http://amturing.acm.org/award_winners/diffie_8371646.cfm</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></p></li> <li id="fn:28"><p>William Henry Eccles and Frank Wilfred Jordan, "Improvements in ionic relays" British patent number: GB 148582 (filed: 1918-06-21; published: 1920-08-05). Available on-line at: http://v3.espacenet.com/origdoc?DB=EPODOC&IDX=GB148582&F=0&QPN=GB148582 . <a href="http://v3.espacenet.com/origdoc?DB=EPODOC&IDX=GB148582&F=0&QPN=GB148582" target="_blank">http://v3.espacenet.com/origdoc?DB=EPODOC&IDX=GB148582&F=0&QPN=GB148582</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></p></li> <li id="fn:29"><p>Reddy, R. (1996). "To dream the possible dream". Communications of the ACM. 39 (5): 105–112. doi:10.1145/229459.233436. <a href="https://doi.org/10.1145%2F229459.233436" target="_blank">https://doi.org/10.1145%2F229459.233436</a> <a href="#fnref:29" class="footnote-back-ref">↩</a></p></li> <li id="fn:30"><p>Floyd, R. W. (1979). "The paradigms of programming". Communications of the ACM. 22 (8): 455–460. doi:10.1145/359138.359140. <a href="https://doi.org/10.1145%2F359138.359140" target="_blank">https://doi.org/10.1145%2F359138.359140</a> <a href="#fnref:30" class="footnote-back-ref">↩</a></p></li> <li id="fn:31"><p>"Computer History Museum | Fellow Awards – Steve Furber". Archived from the original on 2013-04-02. <a href="https://web.archive.org/web/20130402210307/http://www.computerhistory.org/fellowawards/hall/bios/Steve,Furber/" target="_blank">https://web.archive.org/web/20130402210307/http://www.computerhistory.org/fellowawards/hall/bios/Steve,Furber/</a> <a href="#fnref:31" class="footnote-back-ref">↩</a></p></li> <li id="fn:32"><p>Gray, Frank (1953-03-17). "Pulse code communication" (PDF). U.S. patent no. 2,632,058 <a href="/wiki/Frank_Gray_(researcher)" target="_blank">/wiki/Frank_Gray_(researcher)</a> <a href="#fnref:32" class="footnote-back-ref">↩</a></p></li> <li id="fn:33"><p>Morgan 1998, pp. 973–975. - Morgan, Samuel P. (September 1998). "Richard Wesley Hamming (1915–1998)" (PDF). Notices of the AMS. 45 (8): 972–977. ISSN 0002-9920. Retrieved 2014-08-30. <a href="https://www.ams.org/notices/199808/mem-morgan.pdf" target="_blank">https://www.ams.org/notices/199808/mem-morgan.pdf</a> <a href="#fnref:33" class="footnote-back-ref">↩</a></p></li> <li id="fn:34"><p>Hamming 1950, pp. 147–160. - Hamming, Richard W. (1950). "Error detecting and error correcting codes" (PDF). Bell System Technical Journal. 29 (2): 147–160. doi:10.1002/j.1538-7305.1950.tb00463.x. MR 0035935. S2CID 61141773. Archived from the original (PDF) on 2006-05-25. <a href="https://web.archive.org/web/20060525060427/http://www.caip.rutgers.edu/~bushnell/dsdwebsite/hamming.pdf" target="_blank">https://web.archive.org/web/20060525060427/http://www.caip.rutgers.edu/~bushnell/dsdwebsite/hamming.pdf</a> <a href="#fnref:34" class="footnote-back-ref">↩</a></p></li> <li id="fn:35"><p>Ling & Xing 2004, pp. 82–88. - Ling, San; Xing, Chaoping (2004). Coding Theory: a First Course. Cambridge: Cambridge University Press. ISBN 978-0-521-82191-9. <a href="#fnref:35" class="footnote-back-ref">↩</a></p></li> <li id="fn:36"><p>Pless 1982, pp. 21–24. - Pless, Vera (1982). Introduction to the Theory of Error-Correcting Codes. New York: Wiley. ISBN 978-0-471-08684-0. <a href="#fnref:36" class="footnote-back-ref">↩</a></p></li> <li id="fn:37"><p>Stearns, R. E. (1994). "Turing Award lecture: It's time to reconsider time". Communications of the ACM. 37 (11): 95–99. doi:10.1145/188280.188379. <a href="https://doi.org/10.1145%2F188280.188379" target="_blank">https://doi.org/10.1145%2F188280.188379</a> <a href="#fnref:37" class="footnote-back-ref">↩</a></p></li> <li id="fn:38"><p>Diffie, W.; Hellman, M. (1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. CiteSeerX 10.1.1.37.9720. doi:10.1109/TIT.1976.1055638. <a href="https://www-ee.stanford.edu/~hellman/publications/24.pdf" target="_blank">https://www-ee.stanford.edu/~hellman/publications/24.pdf</a> <a href="#fnref:38" class="footnote-back-ref">↩</a></p></li> <li id="fn:39"><p>"Cryptography Pioneers Receive 2015 ACM A.M. Turing Award". ACM. <a href="http://amturing.acm.org/award_winners/diffie_8371646.cfm" target="_blank">http://amturing.acm.org/award_winners/diffie_8371646.cfm</a> <a href="#fnref:39" class="footnote-back-ref">↩</a></p></li> <li id="fn:40"><p>Fathers of the Deep Learning Revolution Receive ACM A.M. Turing Award <a href="https://www.acm.org/media-center/2019/march/turing-award-2018" target="_blank">https://www.acm.org/media-center/2019/march/turing-award-2018</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></p></li> <li id="fn:41"><p>"articles58". Shef.ac.uk. 2007-06-29. Archived from the original on 2007-06-29. Retrieved 2017-10-25. <a href="https://web.archive.org/web/20070629182810/http://www.shef.ac.uk/marcoms/eview/articles58/robot.html" target="_blank">https://web.archive.org/web/20070629182810/http://www.shef.ac.uk/marcoms/eview/articles58/robot.html</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></p></li> <li id="fn:42"><p>"Ancient Discoveries, Episode 11: Ancient Robots". History Channel. Retrieved 2008-09-06.[dead YouTube link] <a href="https://www.youtube.com/watch?v=rxjbaQl0ad8" target="_blank">https://www.youtube.com/watch?v=rxjbaQl0ad8</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></p></li> <li id="fn:43"><p>Kirsch, Russell A., "Earliest Image Processing", NISTS Museum; SEAC and the Start of Image Processing at the National Bureau of Standards, National Institute of Standards and Technology, archived from the original on 2014-07-19 <a href="https://web.archive.org/web/20140719103629/http://museum.nist.gov/panels/seac/EARLIEST.HTM" target="_blank">https://web.archive.org/web/20140719103629/http://museum.nist.gov/panels/seac/EARLIEST.HTM</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></p></li> <li id="fn:44"><p>Kleinrock, Leonard (1961), "Information flow in large communication nets", RLE Quarterly Progress Report (1) <a href="/wiki/Leonard_Kleinrock" target="_blank">/wiki/Leonard_Kleinrock</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></p></li> <li id="fn:45"><p>Simon S. Lam, 2023 Internet Hall of Fame inductee <a href="https://www.internethalloffame.org/inductee/simon-s-lam" target="_blank">https://www.internethalloffame.org/inductee/simon-s-lam</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></p></li> <li id="fn:46"><p>Milner, R. (1993). "Elements of interaction: Turing award lecture". Communications of the ACM. 36: 78–89. doi:10.1145/151233.151240. <a href="https://doi.org/10.1145%2F151233.151240" target="_blank">https://doi.org/10.1145%2F151233.151240</a> <a href="#fnref:46" class="footnote-back-ref">↩</a></p></li> <li id="fn:47"><p>Nakamoto, Satoshi (2009-05-24). ""Bitcoin: A Peer-to-Peer Electronic Cash System" (PDF)" (PDF). bitcoin.org. <a href="https://bitcoin.org/bitcoin.pdf" target="_blank">https://bitcoin.org/bitcoin.pdf</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></p></li> <li id="fn:48"><p>Fred Joseph Gruenberger, The History of the JOHNNIAC, RAND Memorandum 5654 <a href="https://www.rand.org/pubs/research_memoranda/RM5654.html" target="_blank">https://www.rand.org/pubs/research_memoranda/RM5654.html</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></p></li> <li id="fn:49"><p>Kak, Subhash C. (January 1987). "The Paninian approach to natural language processing". International Journal of Approximate Reasoning. 1 (1): 117–130. doi:10.1016/0888-613X(87)90007-7. <a href="https://doi.org/10.1016%2F0888-613X%2887%2990007-7" target="_blank">https://doi.org/10.1016%2F0888-613X%2887%2990007-7</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></p></li> <li id="fn:50"><p>"Judea Pearl". ACM. <a href="http://amturing.acm.org/award_winners/pearl_2658896.cfm" target="_blank">http://amturing.acm.org/award_winners/pearl_2658896.cfm</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></p></li> <li id="fn:51"><p>"Olivetti Programma 101 Electronic Calculator". The Old Calculator Web Museum. technically, the machine was a programmable calculator, not a computer. <a href="https://www.oldcalculatormuseum.com/c-programma101.html" target="_blank">https://www.oldcalculatormuseum.com/c-programma101.html</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></p></li> <li id="fn:52"><p>"2008/107/1 Computer, Programma 101, and documents (3), plastic / metal / paper / electronic components, hardware architect Pier Giorgio Perotto, designed by Mario Bellini, made by Olivetti, Italy, 1965–1971". www.powerhousemuseum.com. Retrieved 2016-03-20. <a href="http://www.powerhousemuseum.com/collection/database/?irn=378406" target="_blank">http://www.powerhousemuseum.com/collection/database/?irn=378406</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></p></li> <li id="fn:53"><p>"Olivetti Programma 101 Electronic Calculator". The Old Calculator Web Museum. It appears that the Mathatronics Mathatron calculator preceeded [sic] the Programma 101 to market. <a href="https://www.oldcalculatormuseum.com/c-programma101.html" target="_blank">https://www.oldcalculatormuseum.com/c-programma101.html</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></p></li> <li id="fn:54"><p>"A.M. Turing Award Laureate – Amir Pnueli". amturing.acm.org. Retrieved 2018-11-04. <a href="https://amturing.acm.org/award_winners/pnueli_4725172.cfm" target="_blank">https://amturing.acm.org/award_winners/pnueli_4725172.cfm</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></p></li> <li id="fn:55"><p>Rabin, M. O.; Scott, D. (1959). "Finite Automata and Their Decision Problems". IBM Journal of Research and Development. 3 (2): 114. doi:10.1147/rd.32.0114. S2CID 3160330. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></p></li> <li id="fn:56"><p>Rabin, M. O. (1977). "Complexity of computations". Communications of the ACM. 20 (9): 625–633. doi:10.1145/359810.359816. <a href="https://doi.org/10.1145%2F359810.359816" target="_blank">https://doi.org/10.1145%2F359810.359816</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></p></li> <li id="fn:57"><p>Scott, D. S. (1977). "Logic and programming languages". Communications of the ACM. 20 (9): 634–641. doi:10.1145/359810.359826. <a href="https://doi.org/10.1145%2F359810.359826" target="_blank">https://doi.org/10.1145%2F359810.359826</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></p></li> <li id="fn:58"><p>Reddy, R. (1996). "To dream the possible dream". Communications of the ACM. 39 (5): 105–112. doi:10.1145/229459.233436. <a href="https://doi.org/10.1145%2F229459.233436" target="_blank">https://doi.org/10.1145%2F229459.233436</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></p></li> <li id="fn:59"><p>Rabin, M. O.; Scott, D. (1959). "Finite Automata and Their Decision Problems". IBM Journal of Research and Development. 3 (2): 114. doi:10.1147/rd.32.0114. S2CID 3160330. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></p></li> <li id="fn:60"><p>Rabin, M. O. (1977). "Complexity of computations". Communications of the ACM. 20 (9): 625–633. doi:10.1145/359810.359816. <a href="https://doi.org/10.1145%2F359810.359816" target="_blank">https://doi.org/10.1145%2F359810.359816</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></p></li> <li id="fn:61"><p>Scott, D. S. (1977). "Logic and programming languages". Communications of the ACM. 20 (9): 634–641. doi:10.1145/359810.359826. <a href="https://doi.org/10.1145%2F359810.359826" target="_blank">https://doi.org/10.1145%2F359810.359826</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></p></li> <li id="fn:62"><p>Nigel Tout. "The Busicom 141-PF calculator and the Intel 4004 microprocessor". Retrieved 2009-11-15. <a href="http://www.vintagecalculators.com/html/busicom_141-pf_and_intel_4004.html" target="_blank">http://www.vintagecalculators.com/html/busicom_141-pf_and_intel_4004.html</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></p></li> <li id="fn:63"><p>Federico Faggin, The Making of the First Microprocessor, IEEE Solid-State Circuits Magazine, Winter 2009, IEEE Xplore <a href="/wiki/Federico_Faggin" target="_blank">/wiki/Federico_Faggin</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></p></li> <li id="fn:64"><p>Japan, Information Processing Society of. "Shima Masatoshi-Computer Museum". museum.ipsj.or.jp. Retrieved 2017-10-25. <a href="http://museum.ipsj.or.jp/en/pioneer/shima.html" target="_blank">http://museum.ipsj.or.jp/en/pioneer/shima.html</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></p></li> <li id="fn:65"><p>2007 Turing Award Winners Announced <a href="http://www.ddj.com/206103622" target="_blank">http://www.ddj.com/206103622</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></p></li> <li id="fn:66"><p>Stearns, R. E. (1994). "Turing Award lecture: It's time to reconsider time". Communications of the ACM. 37 (11): 95–99. doi:10.1145/188280.188379. <a href="https://doi.org/10.1145%2F188280.188379" target="_blank">https://doi.org/10.1145%2F188280.188379</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></p></li> <li id="fn:67"><p>Claude Shannon (1948). "Bell System Technical Journal". Bell System Technical Journal. <a href="#fnref:67" class="footnote-back-ref">↩</a></p></li> <li id="fn:68"><p>Wilkinson, J. H. (1971). "Some Comments from a Numerical Analyst". Journal of the ACM. 18 (2): 137–147. doi:10.1145/321637.321638. S2CID 37748083. <a href="https://doi.org/10.1145%2F321637.321638" target="_blank">https://doi.org/10.1145%2F321637.321638</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></p></li> <li id="fn:69"><p>Copeland, B. Jack (2017-10-25). Zalta, Edward N. (ed.). The Stanford Encyclopedia of Philosophy. Metaphysics Research Lab, Stanford University. Retrieved 2017-10-25 – via Stanford Encyclopedia of Philosophy. <a href="https://plato.stanford.edu/archives/fall2008/entries/computing-history/" target="_blank">https://plato.stanford.edu/archives/fall2008/entries/computing-history/</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></p></li> </ol>