Search

Lovelace translated an account of Babbage’s Analytical Engine and expanded it with notes explaining its programming possibilities.

Shamir collaborated with Ronald Rivest and Leonard Adleman on practical public-key cryptography.

Al-Khwarizmi wrote on Hindu-Arabic numerals and algebra. The word algorithm derives from the transmission of his name.

Kay contributed to object-oriented programming, personal computing and graphical interfaces, and led the team that developed Smalltalk.

Turing used an abstract machine model to examine computable numbers and the limits of effective procedures.

Church developed the lambda calculus and proved an undecidability result for first-order logic.

Wang patented a pulse-transfer controlling device that contributed to practical magnetic-core memory.

Aristotle systematized deductive reasoning by studying relations between terms and the forms of syllogisms.

Avicenna revised syllogistic reasoning, including the treatment of modal propositions and their logical relations.

Liskov developed ideas about data abstraction and modularity and led the team that created CLU.

Holberton, then Betty Snyder, was one of the six ENIAC programmers.

Gates co-founded Microsoft with Paul Allen and led its growth as a software company.

Stroustrup designed and implemented C++ at Bell Labs, drawing on C and ideas from Simula.

Pascal developed the Pascaline, a mechanical calculator associated with his father’s tax-accounting work.

Frankston founded Software Arts with Dan Bricklin to develop and sell the VisiCalc spreadsheet for personal computers.

Kahn worked on ARPANET system design and packet switching at BBN and helped initiate open-architecture internetworking.

Boethius’s Latin logical writings helped transmit ancient logic into medieval intellectual traditions.

Brahmagupta wrote on mathematics and astronomy, including number systems, square-root procedures and quadratic equations.

Gregg developed performance-analysis methods and tools, including work on flame graphs and contributions to BPF tracing tools.

Lampson contributed to networked personal workstations, operating systems, security and document systems, including work on the Alto at Xerox PARC.

Babbage’s calculating engines connect mechanical engineering with the design of programmable calculation.

Bachman developed the Integrated Data Store, a database system using network-oriented data structures.

Thacker led hardware development of the Xerox Alto and contributed to networked personal computing.

Chrysippus developed Stoic reasoning about whole propositions joined by connectives. This differs from studying only relations between category terms.

Two connections in Shannon’s work — logic with switching circuits, and probability with communication.

Berry collaborated with John Atanasoff to design and build the Atanasoff-Berry Computer at Iowa State.

Bricklin helped develop the VisiCalc spreadsheet, which gave business users a compelling application for personal computers.

Hilbert investigated the foundations of geometry through explicit axioms and their relationships. His research ranged across mathematics and physics.

Ritchie created the C programming language and co-developed Unix with Ken Thompson at Bell Labs.

Dignāga developed accounts of inference and argument in Indian Buddhist philosophy, including the wheel of reasons.

Knuth contributed to the systematic study of algorithms and created the TeX typesetting system.

Vaughan led the segregated West Area Computing unit at NACA and later became an expert FORTRAN programmer.

Engelbart and his laboratory developed interactive tools including the mouse and NLS, combining text, hypertext and collaboration.

McIlroy developed the idea of Unix pipes and promoted composing programs from small tools that exchange streams.

Codd proposed the relational model, organizing data by values and relations rather than navigational storage paths.

Dijkstra developed a shortest-path algorithm for graphs, a central contribution to algorithm design.

Bina co-created the Mosaic browser with Marc Andreessen at NCSA.

Euclid organized mathematical propositions and proofs in the Elements. The work became a durable model of systematic mathematical exposition.

Faggin developed silicon-gate technology and led implementation work on Intel’s MCS-4 chips, working with Masatoshi Shima.

Spence, then Frances Bilas, was one of the six ENIAC programmers.

Brooks contributed to computer architecture, operating systems and software engineering, including management of IBM System/360 work and The Mythical Man-Month.

Kildall developed CP/M and established Digital Research to develop and market personal-computer software.

Hinton contributed conceptual and engineering advances in deep neural networks, recognized jointly with Bengio and LeCun.

Cantor developed set theory and the study of different infinite cardinalities.

Boole brought algebraic methods into the study of logic. His mathematical work also included probability and differential equations.

Moore helped found Fairchild Semiconductor and Intel and described a trend in component integration that became known as Moore’s law.

Leibniz worked on mechanical calculation and binary arithmetic, alongside mathematics and philosophy.

Frege’s Begriffsschrift introduced a formal logical language with implication, negation and universal quantification.

Hopper worked on early computers and compiler development, including participation in the team behind FLOW-MATIC.

Van Rossum created Python and guided the development of its language and community.

Hollerith developed the electric punched-card tabulating system used for the United States census.

Aiken proposed the automatic calculator that became the Harvard Mark I, designed and built with IBM.

Sutherland developed Sketchpad, an interactive graphical system described in his MIT doctoral dissertation.

Kilby demonstrated circuits whose active and passive elements were formed from semiconductor material at Texas Instruments.

Forrester developed coincident-current magnetic-core memory while leading the MIT Whirlwind project.

Licklider articulated a vision of globally networked computers and supported interactive computing through his work at ARPA.

Bartik programmed ENIAC and helped adapt it for instructions stored in memory.

Atanasoff designed and built the Atanasoff-Berry Computer with graduate student Clifford Berry at Iowa State.

Backus led work on FORTRAN and contributed to notation for specifying programming-language syntax.

Bardeen investigated semiconductor surface states and developed the point-contact transistor with Walter Brattain at Bell Labs.

Buridan developed medieval logic through work on terms, arguments and their use, including his Summulae de dialectica.

Mauchly co-designed ENIAC with J. Presper Eckert.

McCarthy helped establish artificial intelligence as a research field, developed Lisp and proposed ideas for time-sharing.

Von Neumann contributed to the logical design of computers and to automata theory, alongside extensive mathematical research.

Jacquard developed a loom mechanism in which linked punched cards controlled weaving patterns.

Spärck Jones researched automatic language processing, document retrieval, summarization and the evaluation of information systems.

Johnson performed mathematical analysis and calculations for the United States space program after joining NACA.

McNulty was one of the six women who programmed ENIAC.

Thompson co-created Unix with Dennis Ritchie at Bell Labs and worked on languages and operating systems including B and Plan 9.

Zuse built program-controlled electromechanical computers and developed the early programming language Plankalkül.

Nygaard co-designed Simula with Ole-Johan Dahl, helping establish object-oriented programming.

Gödel proved completeness for first-order logic and incompleteness results for formal arithmetic.

Page co-authored the paper describing the Google search prototype with Sergey Brin, using hyperlink structure in Web search.

Adleman collaborated with Ronald Rivest and Adi Shamir on practical public-key cryptography.

Lamport contributed to the theory and design of distributed and concurrent systems and created the initial LaTeX document preparation system.

Torvalds created the Linux kernel and coordinated its open-source development with a growing community of contributors.

Andreessen co-created the Mosaic browser with Eric Bina at NCSA.

Hamilton led work on Apollo flight software and contributed to software engineering, with earlier experience on weather and SAGE software.

Meltzer, then Marlyn Wescoff, was one of the six ENIAC programmers.

Hellman co-authored New Directions in Cryptography with Whitfield Diffie and contributed to public-key cryptography alongside Diffie and Ralph Merkle.

Jackson worked in NACA’s West Area Computing section before moving into wind-tunnel research and aeronautical engineering.

Mozi’s teachings initiated the Mohist tradition of explicit argument, standards of judgment and debate in ancient China.

Wirth developed programming languages including Pascal, Modula-2 and Oberon, alongside work on programming environments.

Wiener brought together questions of control and communication in cybernetics, alongside mathematical work in probability and related areas.

Dahl co-designed Simula with Kristen Nygaard, helping establish object-oriented programming.

Allen co-founded Microsoft with Bill Gates and served as its chief technologist during its early years.

Abelard wrote commentaries and independent works on dialectic, logic and the philosophy of language.

Naur contributed to ALGOL 60’s definition, programming-language design and compiler design.

Zimmermann created Pretty Good Privacy (PGP) and made email encryption software available for public use.

Plato founded the Academy in Athens, where philosophy and mathematics formed part of a shared intellectual setting.

Eckert co-designed ENIAC with John Mauchly.

Llull combined symbolic notation with combinatorial diagrams in a project to organize knowledge and support argument.

Hamming is associated with error-correcting codes that bear his name.

Stallman announced the GNU project to build a free operating system and helped establish the free-software movement.

Metcalfe developed Ethernet at Xerox PARC in collaboration with David Boggs.

Noyce proposed a monolithic integrated-circuit structure using metal interconnections above an oxide layer, building on Jean Hoerni’s planar process.

Taylor supported research in interactive computing and networking through leadership and funding, including support for Engelbart’s work.

Rivest collaborated with Adi Shamir and Leonard Adleman on practical public-key cryptography.

Teitelbaum, then Ruth Lichterman, was one of the six ENIAC programmers.

The name Satoshi Nakamoto appears on the Bitcoin paper proposing peer-to-peer electronic cash with proof-of-work transaction ordering.

Lebedev led the team that developed the MESM electronic computer at the Institute of Electrical Engineering in Kyiv.

Brin co-authored the paper describing the Google search prototype with Larry Page, using hyperlink structure in Web search.

Goldwasser helped establish complexity-based cryptography and methods for efficient proof verification with Silvio Micali.

Micali helped establish complexity-based cryptography and methods for efficient proof verification with Shafi Goldwasser.

Wilson worked with Steve Furber on the BBC Micro and ARM architecture, and wrote the BBC BASIC interpreter.

Furber was a principal designer of the BBC Micro and co-designed the ARM processor with Sophie Wilson at Acorn.

Jobs co-founded Apple with Steve Wozniak and later founded NeXT, contributing leadership in personal computing and interface design.

Wozniak designed the Apple I and Apple II and co-founded Apple with Steve Jobs.

Nelson developed ideas about hypertext and a multimedia publishing system called Xanadu.

Berners-Lee developed the World Wide Web at CERN by combining hypertext with Internet communication and resource identifiers.

Hoare developed Quicksort and contributed to the theory of programming languages.

Bush described the Memex, an imagined microfilm-based system for linking and retrieving documents through associative trails.

Cerf co-developed the TCP/IP protocol suite with Robert Kahn and helped guide the development of internetworking.

Brattain worked with John Bardeen on the germanium point-contact transistor at Bell Labs.

Diffie worked with Martin Hellman and Ralph Merkle on public-key cryptography and co-authored New Directions in Cryptography with Hellman.

Ockham’s Summa of Logic treats terms, propositions and arguments, including modal syllogisms.

Shockley organized Bell Labs’ solid-state group and pursued semiconductor amplifier concepts. Bardeen and Brattain achieved the point-contact device within that research setting.

LeCun contributed conceptual and engineering advances in deep neural networks, recognized jointly with Hinton and Bengio.

Bengio contributed conceptual and engineering advances in deep neural networks, recognized jointly with Hinton and LeCun.

Separate Hilbert's foundational ambitions, Gödel's incompleteness, Church and Turing's computability results, and Shannon's circuit analysis.

The 1931 publication limits what suitable formal arithmetic theories can prove, rather than declaring all reasoning impossible.

Shannon’s 1937 thesis work and its 1938 paper connected symbolic logic with the analysis and synthesis of relay networks.

Follow telegraph systems, parallel packet-network research, ARPANET, TCP/IP and the Web, then examine why distributed applications must handle delay and uncertainty.

The coordinated 1 January 1983 transition replaced NCP on ARPANET; it was a deployment milestone in a longer internetworking history.

Separate switching devices, stored-program organization, integrated circuits and microprocessors while following the teams and engineering problems behind them.

On 21 June 1948, Manchester’s experimental machine executed a program held in electronic memory.

Connect Hartley's logarithmic measure, Shannon's probabilistic communication theory, coding limits and Wiener's feedback-centered cybernetics through original worked examples.

In 1948, Shannon framed communication around message selection, channels and noise.

Follow calculation procedures, al-Khwarizmi's transmitted arithmetic, binary representation, Boole's algebra and the distinction between testing and proving a program.

Compare hand-operated calculators, Jacquard control cards, Babbage's difference and analytical engines, and Lovelace's account of a machine that remained unbuilt.

The 1843 account with Lovelace’s notes describes computations for Babbage’s unbuilt complete Analytical Engine.

Connect mobile integration, open-source communities, GPU computing, AI, semiconductor constraints and quantum algorithms without treating benchmarks or forecasts as universal progress.

The 2012 paper by Krizhevsky, Sutskever and Hinton documents a specific image-classification system and its evaluation.

Distinguish language, durable records, numerical notation and coding through early accounting, writing and the changing roles of zero.

Compare term reasoning, propositional arguments, medieval developments and Leibniz's symbolic ambitions without treating them as one inevitable route to computers.

Follow symbolic assembly, compiler teams, operating-system services, Unix and graphical interfaces as changes in who manages the machine's details.

The 1957 paper, manuals and release correspondence document a compiler team’s implementation, beyond the earlier proposal.

Predict and verify AND, OR, NOT and XOR with two inputs and complete truth tables.

The third computing-stack domain: five lessons on bonding, crystals, silicon, doping and material properties, with worked exercises and a synthesis problem.

The ninth computing-stack domain: six lessons on ISA, execution, pipelines, caches, buses and CPU/GPU parallelism with traced programs and worked exercises.

Five introductory chapters on reasoning, units, signals, information and models, before studying circuits or software.

Extend digital logic with an FSM, a four-bit ALU and a ready/valid interface, then reason about registered computation.

A seven-step route through Boolean rules, gates, selection, arithmetic, storage and a clocked counter.

The sixth computing-stack domain: seven lessons on circuits, analog/digital interfaces, schematics, layout, power, signal integrity and measurement, with worked exercises.

The tenth computing-stack domain: six lessons on MCU registers, boot, interrupts, DMA, RTOS scheduling and embedded Linux, with worked exercises.

Six lessons connect RTL, verification, synthesis, timing, physical design and ASIC/FPGA targets, with scoped exercises.

Learn the operations, examine their historical use, then verify a model in the gate workbench.

A five-chapter introduction to electricity, fields, quantum ideas, heat and solids after the computing foundations.

The fifth computing-stack domain: six progressive lessons on PN junctions, diode models, MOSFETs, CMOS, scaling and leakage, with worked exercises.

The fourth computing-stack domain: six lessons on substrates, lithography, films, implantation, interconnects, testing and packaging, with worked exercises.

Count protons, neutrons and electrons, distinguish isotopes from ions, and explain the energy sign of a covalent bond.

Count shared atoms in cubic cells, scale a repeating volume and distinguish vacancies, substitutions and interstitials.

Derive a sample resistance from resistivity and shape, convert areas correctly, and evaluate several material requirements together.

Explain n-type and p-type silicon, count dopants and derive a scoped compensation approximation without confusing carriers with net charge.

Count shared bonds, derive the SiO2 atom ratio and distinguish substrate silicon from an electrically insulating oxide.

Distinguish MMIO from RAM, calculate burst payload rate and reason about arbitration, ordering and completion.

Map byte addresses into a direct-mapped cache, reproduce a miss trace and calculate access-time and write-policy consequences.

Compare data-parallel execution, lane utilization and scoped scaling limits using end-to-end work and traffic.

Execute a complete eight-bit teaching program, trace wraparound and branches and connect state changes to a datapath.

Distinguish instruction semantics from hardware organization, read RV32I state and compare scoped execution-time models.

Trace pipeline stages, distinguish latency from throughput and budget stalls without changing architectural behavior.

Combine a four-bit adder, Boolean functions and selection; distinguish unsigned carry from signed overflow and connect computation to storage.

Derive a full adder, follow carries through four bits, and distinguish unsigned carry from signed overflow.

Describe two-state decisions with AND, OR and NOT, then connect the expressions to switching circuits.

Specify a function, build it from gates, and verify a selector without confusing logic with timing.

Design a serial pattern detector, preserve overlapping matches, encode its states and verify every short input stream.

Turn Boolean operations into connected components, and distinguish a logical result from an electrical implementation.

Separate holding a value from computing one, then organize stored bits into registers and addressed words.

Combine stored state with a next-state function, trace a counter, and account for the time between clock edges.

Trace accepted values, preserve pending data and separate interface throughput, latency, buffering and clock-domain assumptions.

Compare logic-level guarantees, calculate RC settling and distinguish physical waveforms from logical interpretations.

Apply current and voltage balance, calculate divider loading and reconcile power in a DC network.

Include the probe in the circuit, estimate measurement loading and separate resolution, accuracy and repeatability.

Calculate conductor resistance and clearance, follow return currents and distinguish connectivity checks from performance.

Reconcile regulator power, calculate capacitor droop and explain why effective capacitance and connection impedance matter.

Trace an explicit netlist, map electrical pins to physical pads and understand the scope of schematic checks.

Compare propagation with edge time, calculate first load reflections and distinguish incident-wave amplitude from source voltage.

Follow device/CPU buffer ownership, calculate fill intervals and preserve FIFO capacity while separating coherence from ordering.

Connect loader, kernel, hardware description and user space, then budget independent storage/RAM models and reason about recovery.

Budget event-to-handler latency, separate device flags from controller state and preserve driver lifetime across concurrent completion paths.

Connect bare-metal code to specified registers, distinguish read/write and W1C behavior and separate volatile from synchronization.

Trace a preemptive schedule, calculate scoped response times and distinguish utilization, blocking and synchronization.

Explain the path to main, budget RAM and vectors and distinguish image loading, authenticity and recovery policy.

Count binary possibilities, decode a small unsigned number and separate a bit pattern from its meaning.

Read variables, evaluate a rule and distinguish an example, a counterexample and a proof.

State what a model promises, trace its predictions and identify where its assumptions stop applying.

Separate a physical signal from the discrete state it represents, then read a simple time trace.

Keep units in a calculation, convert powers of ten and distinguish a duration from a rate.

Understand LUTs, registers and dedicated resources, compare a scoped cost model and separate configuration from fabrication.

Turn a netlist into geometry, calculate utilization and wiring effects, and distinguish connectivity, geometry and timing checks.

Describe a registered four-bit accumulator in Verilog, separate combinational wiring from clocked storage and trace simultaneous state updates.

Build an independent oracle, distinguish exhaustive scope from coverage and understand bounded formal and equivalence checks.

Calculate setup and hold slack for a clocked path, derive the effect of skew and distinguish timing constraints from functional simulation.

Lower a circuit description into connected implementation cells, reason about Boolean equivalence and account for resource sharing without changing cycle behavior.

Distinguish electrical quantities and calculate current, power and transferred energy in an ideal resistor circuit.

Read the direction of an electric force and calculate a simple induced voltage from a changing magnetic flux.

Balance electrical input, heat leaving a system and stored energy without confusing watts, joules and temperature.

Distinguish probability from amplitude and calculate energy differences in a three-level teaching model.

Connect a repeating crystal model to allowed electron energies, then distinguish a band diagram from a conductivity prediction.

Build an inverter and NAND, separate settled states from transitions and account for capacitive switching energy.

Calculate geometric density and dynamic-power ratios without equating transistor count with speed or efficiency.

Distinguish a continuous junction law from a constant-drop approximation and reconcile circuit power.

Distinguish leakage paths, compute standby energy and compare clock gating, sleep and task energy.

Use source-relative gate voltages, distinguish threshold from low resistance and solve a scoped switch circuit.

Explain equilibrium, fixed space charge and bias, then balance depletion widths in an abrupt-junction model.

Track a film through deposition and mask transfer, calculate a cycle-based thickness and budget underlayer and mask loss.

Separate dose from concentration, follow a uniform-profile counting model and distinguish retained dopants, activation and mobile carriers.

Read electrical connectivity across levels, follow damascene-style fill and CMP, and calculate a line-and-via resistance model.

Trace positive and negative resist, distinguish a resist opening from a material etch, and calculate a simple overlay margin.

Separate die and package tests, multiply stage fractions with the right denominators and reason about multi-die assembly assumptions.

Follow an ingot into wafer form, distinguish wafer, die and package, and read process changes in top view and cross-section.