Bilgisayar ve Programlamaya Giriş · People
Important People in Computing and Programming
55 profiles of the mathematicians, engineers and programmers behind the ideas used in the course, from Euclid's algorithm and Boole's logic to Turing machines, the transistor, the internet, Unix, spreadsheets and Java. Each card links to the course chapters where the person's work appears; open "More" for details.
Euclid of Alexandria
Euclid's algorithm (GCD) · Elements, Book VII
Described in the Elements the procedure for the greatest common divisor that is still taught as one of the oldest known algorithms.
Why it matters: The rule gcd(a, b) = gcd(b, a mod b), ending when b = 0, is the course's model example of both a loop-based and a recursive method.
Euclid's original version used repeated subtraction; the remainder form is the modern equivalent. Each step makes the numbers smaller, which is the standard argument that the algorithm always stops.
Muhammad ibn Musa al-Khwarizmi
Origin of the words "algorithm" and "algebra"
Wrote influential books on arithmetic with Hindu–Arabic numerals and on solving equations; the Latin form of his name, Algoritmi, gave us the word "algorithm".
Why it matters: His name stands behind the central idea of the course: a finite, precise sequence of steps that solves a problem.
The word "algebra" comes from al-jabr in the title of his book on equations (c. 820). Latin translations of his arithmetic spread decimal place-value notation in medieval Europe.
Leonardo of Pisa (Fibonacci)
Liber Abaci · 1202
Promoted Hindu–Arabic numerals in Europe with Liber Abaci (1202), which includes the rabbit problem that produces the sequence 0, 1, 1, 2, 3, 5, 8, …
Why it matters: F(n) = F(n−1) + F(n−2) is the classic exercise for loops and for showing why naive recursion repeats work.
The sequence was known earlier in Indian mathematics; the name "Fibonacci sequence" was popularised in the 19th century by Édouard Lucas. Its terms grow so fast that even a Java long overflows after about 92 terms.
Gottfried Wilhelm Leibniz
Binary arithmetic · 1703 · stepped reckoner
Published an account of binary arithmetic using only 0 and 1 (1703) and built a mechanical calculator, the stepped reckoner.
Why it matters: Every number, character and instruction in a computer is stored in the binary system that Leibniz described.
His "Explication de l'arithmétique binaire" appeared in the memoirs of the Paris Academy of Sciences. He also dreamed of a formal language in which reasoning could be carried out by calculation.
Joseph Marie Jacquard
Punched-card loom · 1804
Built a loom attachment (demonstrated around 1804) that wove patterns automatically, controlled by a chain of punched cards.
Why it matters: Changing the cards changed the pattern without changing the machine, an early form of a program kept separate from the hardware.
Babbage planned to feed the Analytical Engine with Jacquard-style cards, and punched cards later carried data and programs well into the 1970s.
Carl Friedrich Gauss
Sum 1 + 2 + … + n = n(n + 1)/2
According to a well-known (possibly embellished) story, found the sum of the numbers 1 to 100 instantly as a schoolboy by pairing terms.
Why it matters: The course compares a summing loop (n additions) with Gauss's formula (one multiplication and one division) to show that algorithms differ in cost.
Gauss became one of the most important mathematicians in history, working in number theory, astronomy, geodesy and magnetism. Gaussian elimination and the Gaussian (normal) distribution carry his name.
Charles Babbage
Difference Engine · Analytical Engine (1837)
Designed the Difference Engine for computing tables and then the Analytical Engine (1837), a general-purpose mechanical computer that was never completed.
Why it matters: The Analytical Engine already separated memory (the "store") from processing (the "mill"), the organisation used in computers today.
The design included conditional branching and loops driven by punched cards. The Science Museum in London completed a working Difference Engine No. 2 from his plans in 1991.
George Boole
Boolean algebra · 1847, 1854
Treated logic as algebra on true/false values in The Mathematical Analysis of Logic (1847) and The Laws of Thought (1854).
Why it matters: Logic gates in the CPU and every condition in an if statement or loop are Boolean expressions; Java's boolean type is named after him.
Boole was largely self-taught and became the first professor of mathematics at Queen's College Cork. Claude Shannon later showed that Boolean algebra describes switching circuits.
Ada Lovelace
Notes on the Analytical Engine · 1843
Translated an article on Babbage's Analytical Engine and added extensive notes (1843), including a step-by-step method for computing Bernoulli numbers.
Why it matters: Her Note G is often called the first computer program, and she saw that such a machine could process symbols, not only numbers.
She was the daughter of the poet Lord Byron. The programming language Ada (1980) is named after her, and Ada Lovelace Day celebrates women in science and technology.
Édouard Lucas
Tower of Hanoi puzzle · 1883
Invented and marketed the Tower of Hanoi puzzle in 1883 under the pseudonym "N. Claus de Siam".
Why it matters: Moving n discs reduces to moving n − 1 discs twice, the textbook example of a problem whose recursive solution is far simpler than an iterative one.
Lucas also studied the Fibonacci numbers (and gave them that name), the related Lucas numbers, and tests for prime numbers.
Herman Hollerith
Punched-card tabulator · 1890 US census
Built electromechanical machines that counted data recorded on punched cards and used them to process the 1890 US census.
Why it matters: His tabulators turned data processing into an industry: input, processing and output on machines.
His Tabulating Machine Company (1896) merged into the Computing-Tabulating-Recording Company in 1911, which was renamed International Business Machines (IBM) in 1924.
Alonzo Church
Lambda calculus · Church–Turing thesis
Created the lambda calculus and in 1936 used it to show that the Entscheidungsproblem (decision problem) of logic has no general solution.
Why it matters: The Church–Turing thesis states that anything computable by an effective procedure is computable by a Turing machine (equivalently, in the lambda calculus).
Church reached the result shortly before Turing, by a different method. He supervised Turing's PhD at Princeton (1938). The lambda calculus is the basis of functional programming and of lambda expressions in modern languages.
John von Neumann
Stored-program architecture · 1945 · merge sort
Described the stored-program computer, with program and data in the same memory, in the First Draft of a Report on the EDVAC (1945).
Why it matters: The CPU–memory organisation taught in Chapter 1, and its "von Neumann bottleneck", carry his name.
He is credited with merge sort (1945), and with Herman Goldstine he introduced flow diagrams for planning programs (1947). He also made major contributions to game theory, quantum mechanics and numerical analysis.
Tommy Flowers
Colossus · 1944
Designed and built Colossus, an electronic machine using vacuum tubes (valves) that helped break German Lorenz ciphers at Bletchley Park from early 1944.
Why it matters: Colossus showed that large numbers of valves could work reliably for digital computation; it was programmable by switches and plugs but did not store its program.
Colossus Mark 1 had about 1,600 valves and Mark 2 about 2,400. The machines were kept secret for decades, so Flowers received little public credit until the 1970s.
Grace Hopper
A-0 compiler · FLOW-MATIC · COBOL
Built the A-0 system (1952), an early compiler, and the English-like FLOW-MATIC language, which strongly influenced COBOL (1959).
Why it matters: She argued that programs should be written in human-readable languages and translated automatically, the idea behind every compiler in the course.
She programmed the Harvard Mark I during the Second World War. Her team's logbook with a moth taped in it (1947) is a famous story about computer "bugs", although the word was already in use. She received the Presidential Medal of Freedom posthumously in 2016.
John Mauchly & J. Presper Eckert
ENIAC · 1945–46 · UNIVAC I
Led the design of ENIAC, a general-purpose electronic computer completed in 1945 and unveiled in February 1946.
Why it matters: ENIAC demonstrated large-scale electronic computation; the problems of reprogramming it with cables led directly to the stored-program design.
ENIAC used about 18,000 vacuum tubes and was programmed by setting switches and cables. Their company built UNIVAC I, first delivered to the US Census Bureau in 1951.
John Bardeen, Walter Brattain & William Shockley
Transistor · 1947
Bardeen and Brattain built the first point-contact transistor at Bell Labs in December 1947; Shockley soon designed the junction transistor.
Prizes: Nobel Prize in Physics 1956 (shared by the three); Bardeen won a second physics Nobel in 1972
Why it matters: A transistor acts as a tiny electronic switch; logic gates and processors are built from millions to billions of them.
Transistors replaced vacuum tubes because they are smaller, faster, cooler and more reliable. Shockley's later company helped start Silicon Valley, and several of its engineers left to found Fairchild Semiconductor.
Konrad Zuse
Z3 · 1941 · Plankalkül
Completed the Z3 in 1941, a programmable, fully automatic digital computer built from relays, and designed Plankalkül, an early high-level programming language.
Why it matters: The Z3 used binary arithmetic and floating-point numbers, ideas central to Chapter 1 and to Java's double type.
The Z3 read its program from punched film and was destroyed in a 1943 air raid. Plankalkül was designed between 1942 and 1945 but published only in 1972.
Alan Turing
Turing machine · 1936
Defined the Turing machine in "On Computable Numbers" (1936) and proved that some problems cannot be solved by any algorithm.
Why it matters: The universal Turing machine, which reads another machine's rules from its tape, is the theoretical form of the stored-program idea.
During the Second World War he led work on breaking Enigma at Bletchley Park. He designed the ACE computer (1945) and proposed the Turing test (1950). The ACM Turing Award, first given in 1966, is named after him.
Herman Goldstine
Flow diagrams · 1947
With von Neumann, wrote "Planning and Coding of Problems for an Electronic Computing Instrument" (1947–48), which introduced flow diagrams for designing programs.
Why it matters: The boxes and arrows of flowcharts, used in Chapter 4, descend from these reports.
As an army officer he was the liaison for the ENIAC project and introduced von Neumann to it in 1944. He later directed the IAS computer project and wrote a history of computing, The Computer from Pascal to von Neumann (1972).
Claude Shannon
Switching circuits · 1937 · information theory · 1948
Showed in his 1937 master's thesis that Boolean algebra can describe and simplify relay switching circuits, and founded information theory in 1948.
Why it matters: His thesis links Boole's logic to the gates inside processors; his 1948 paper made the bit the unit of information.
The word "bit" (binary digit) appears in his 1948 paper, credited there to John Tukey. Information theory underlies data compression and reliable communication over networks.
Bob Bemer
ASCII · escape sequence · backslash
Played a leading role in creating ASCII (first published in 1963), including the escape sequence and the backslash character.
Why it matters: ASCII's 7-bit codes (A = 65) are the first 128 code points of Unicode and the basis of the character arithmetic used in the course.
ASCII was a committee effort, but Bemer is often called its father. He proposed the backslash in 1961, and was one of the early voices warning about the year-2000 date problem.
Corrado Böhm & Giuseppe Jacopini
Structured program theorem · 1966
Proved (Communications of the ACM, 1966) that any flowchart program can be rewritten using only sequence, selection and iteration.
Why it matters: The three control structures of Chapters 4, 7 and 8 are enough for every algorithm; goto-style jumps are not needed.
Their result gave the theoretical basis for structured programming, promoted by Dijkstra from 1968. Böhm later did important work on the lambda calculus.
Jack Kilby & Robert Noyce
Integrated circuit · 1958–59
Independently invented the integrated circuit: Kilby demonstrated one at Texas Instruments in 1958, and Noyce devised the practical silicon planar version at Fairchild in 1959.
Prizes: Kilby: Nobel Prize in Physics 2000 (Noyce had died in 1990)
Why it matters: Putting many transistors on one chip made processors, memory and modern computers possible.
Noyce co-founded Intel with Gordon Moore in 1968. Kilby's team also developed the first handheld electronic calculator (1967).
John Backus
FORTRAN · 1957 · Backus–Naur Form
Led the IBM team that created FORTRAN (1957), the first widely used high-level language with an optimising compiler.
Prizes: Turing Award 1977
Why it matters: FORTRAN showed that compiled code could be nearly as fast as hand-written machine code, which made high-level languages practical.
He proposed a notation for language syntax that Peter Naur used in the ALGOL 60 report; it is known as Backus–Naur Form (BNF) and is still used to define language grammars.
Douglas Engelbart
Computer mouse · "Mother of All Demos" 1968
Invented the computer mouse (built with Bill English in the mid-1960s) and in 1968 demonstrated windows, hypertext and real-time collaborative editing.
Prizes: Turing Award 1997
Why it matters: The pointing and windowing ideas of graphical desktops such as Windows trace back to his work.
His December 1968 demonstration in San Francisco later became known as the "Mother of All Demos". His goal was to use computers to augment human intellect.
Paul Baran & Donald Davies
Packet switching · 1960s
Independently developed packet switching: messages are split into small blocks that travel separately through the network and are reassembled.
Why it matters: Every message on the internet, as shown in Chapter 1, travels as independent packets.
Baran described distributed networks in a series of RAND reports (1964). Davies coined the term "packet" and built a packet-switched network at the NPL in Britain. Their work influenced the design of ARPANET (1969).
John Kemeny & Thomas Kurtz
BASIC · 1964
Created BASIC and the Dartmouth Time-Sharing System, which ran the first BASIC program on 1 May 1964.
Why it matters: BASIC was designed so that students outside science could learn programming, and it became the first language of many home-computer users.
Microsoft's first product was a BASIC interpreter (1975). Kemeny was president of Dartmouth (1970–81); he and Kurtz later founded True BASIC.
John McCarthy
Lisp · 1958 · "artificial intelligence"
Designed Lisp (1958), a language built on recursive functions, and coined the term "artificial intelligence" in the 1955 Dartmouth proposal.
Prizes: Turing Award 1971
Why it matters: Lisp made recursion a normal programming tool and introduced the conditional expression, an ancestor of if–else.
His 1960 paper "Recursive Functions of Symbolic Expressions and Their Computation by Machine" defined Lisp. He also introduced garbage collection and proposed time-sharing.
Seymour Papert
Logo · Mindstorms (1980)
Co-created the Logo language for children (1967) and used the phrase "computational thinking" in his book Mindstorms (1980).
Why it matters: He argued that programming is a way of thinking about problems, an idea later developed by Jeannette Wing.
Logo's turtle graphics let learners give step-by-step commands and see the result. LEGO Mindstorms robotics kits are named after his book.
Gordon Moore
Moore's law · 1965
Observed in 1965 that the number of components on a chip was doubling every year, later revising the rate to about every two years (1975).
Why it matters: Moore's law explains the steady growth in processor power and memory capacity described in the hardware chapter.
He co-founded Intel with Robert Noyce in 1968. The trend held for decades, although it has slowed as transistors approach physical limits.
Edsger W. Dijkstra
Structured programming · "Go To Statement Considered Harmful" 1968
Argued in 1968 that unrestricted goto jumps make programs hard to understand, launching the structured programming movement.
Prizes: Turing Award 1972
Why it matters: Writing programs with clear sequence, selection and loops, as in Java, follows his ideas.
He published his shortest-path algorithm in 1959 and introduced semaphores for coordinating processes; his "dining philosophers" problem illustrates deadlock, a topic of the operating systems chapter.
William Kahan
IEEE 754 floating point · 1985
Was the principal architect of the IEEE 754 standard for floating-point arithmetic (1985).
Prizes: Turing Award 1989
Why it matters: Java's float and double follow IEEE 754, which is why 0.1 + 0.2 prints 0.30000000000000004.
The standard defines formats with sign, exponent and fraction bits, rounding rules, and special values such as infinity and NaN, so the same program gives the same results on different machines.
Tony Hoare
Quicksort · 1959–61
Invented quicksort around 1959–60 and published it in 1961; it sorts by partitioning around a pivot and recursively sorting the parts.
Prizes: Turing Award 1980
Why it matters: Quicksort, like merge sort, is a divide-and-conquer algorithm with average running time O(n log n), far faster than bubble sort on large arrays.
He also developed Hoare logic (1969) for proving programs correct and CSP for concurrency. He introduced the null reference in ALGOL W (1965), which he later called his "billion-dollar mistake". He died on 5 March 2026.
Niklaus Wirth
Pascal · 1970 · Algorithms + Data Structures = Programs
Designed Pascal (1970) as a language for teaching structured programming, followed by Modula-2 and Oberon.
Prizes: Turing Award 1984
Why it matters: Pascal made structured, strongly typed programming the standard in introductory courses for two decades.
His book title Algorithms + Data Structures = Programs (1976) sums up a central idea of this course. He also promoted stepwise refinement: solve a problem by breaking it into smaller steps.
Ted Hoff, Federico Faggin & Masatoshi Shima
Intel 4004 microprocessor · 1971
Created the Intel 4004 (1971), the first commercial single-chip microprocessor, with Stanley Mazor.
Why it matters: Putting the whole CPU on one chip led to personal computers, phones and the processors described in Chapter 1.
Hoff proposed the architecture, Shima of Busicom worked on the logic design, and Faggin led the silicon design. The 4004 had about 2,300 transistors; Faggin and Shima later designed the Zilog Z80.
Donald Knuth
The Art of Computer Programming (from 1968)
Systematised the analysis of algorithms in The Art of Computer Programming, whose first volume appeared in 1968.
Prizes: Turing Award 1974
Why it matters: Comparing linear and binary search, or bubble sort and merge sort, by counting steps is the method he made standard.
Volume 3 of his series covers sorting and searching in depth. He also created the TeX typesetting system (1978) and promoted "literate programming".
Alan Kay
Smalltalk · overlapping windows · Dynabook
At Xerox PARC in the 1970s led the group that developed Smalltalk and the overlapping-window graphical interface.
Prizes: Turing Award 2003
Why it matters: The desktop with windows, icons and menus, which Apple and Microsoft later popularised, grew out of this work.
He is credited with the term "object-oriented" for the approach used in Smalltalk, which influenced Java. His Dynabook concept (1972) imagined a portable computer for children, much like a tablet.
Dennis Ritchie & Ken Thompson
Unix · 1969 · C language · 1972
Created the Unix operating system at Bell Labs from 1969; Ritchie developed the C language (around 1972), in which Unix was rewritten.
Prizes: Turing Award 1983 (joint)
Why it matters: Linux, macOS and Android follow Unix ideas, and the syntax of Java (braces, if, for, while) comes from C.
Thompson also created the B language and, with Rob Pike, designed the UTF-8 encoding (1992). At Google he co-designed the Go language (2009).
Ray Tomlinson
Network email · 1971 · @ sign
Sent the first email between computers on ARPANET in 1971 and chose the @ sign to separate the user name from the host name.
Why it matters: The address format user@host is still used for every email address.
Earlier systems let users of the same computer leave messages for each other; Tomlinson extended this across the network. He was inducted into the Internet Hall of Fame in 2012.
Brian Kernighan
"hello, world" · The C Programming Language (1978)
Wrote the first known "hello, world" programs in Bell Labs tutorials for B (1972) and C (1974), later made famous by the book he wrote with Dennis Ritchie (1978).
Why it matters: Starting a new language by printing a short greeting, as in the Java "Merhaba" program of Chapter 5, is his tradition.
He is the "K" in the AWK language and co-authored several influential books on programming style. The C Programming Language is often called "K&R".
Vint Cerf & Bob Kahn
TCP/IP · 1974
Designed the TCP/IP protocols for connecting different networks (paper published in 1974); ARPANET switched to TCP/IP on 1 January 1983.
Prizes: Turing Award 2004 (joint); US Presidential Medal of Freedom 2005
Why it matters: TCP/IP is the "common rule set" that joins networks into the internet, as shown in the layered protocol slides.
IP carries packets between networks using addresses; TCP delivers data reliably and in order. Both are often called "fathers of the internet".
Robert Gaskins & Dennis Austin
PowerPoint · 1987
Gaskins conceived and Austin led the programming of the presentation program Presenter, released as PowerPoint 1.0 for the Macintosh in 1987.
Why it matters: Slide-based presentation software, covered in Chapter 3, became a standard office tool with PowerPoint.
Microsoft bought Forethought in 1987 for about 14 million dollars, one of its first acquisitions, and PowerPoint later became part of Microsoft Office.
Charles Simonyi
Bravo editor · Microsoft Word
Co-developed Bravo at Xerox PARC with Butler Lampson, an early WYSIWYG ("what you see is what you get") editor, and then led the development of Microsoft Word (1983).
Why it matters: Editing a document on screen in the same form as it will be printed, the basic idea of Word, came from Bravo.
He joined Microsoft in 1981 and led its applications group, which also produced Multiplan and Excel. "Hungarian notation" for naming variables is named after him. He travelled to the International Space Station twice (2007, 2009).
Paul Mockapetris
Domain Name System (DNS) · 1983
Designed the Domain Name System, specified in RFCs 882 and 883 (November 1983), which translates names like www.example.edu into IP addresses.
Why it matters: The step-by-step DNS lookup in Chapter 1 (root, top-level domain, authoritative server) follows his design.
DNS replaced a single HOSTS.TXT file that listed every computer on the network. It is a distributed, hierarchical database with caching; the RFCs were updated as RFC 1034 and 1035 in 1987.
Bjarne Stroustrup
C++ · 1983
Created C++, starting as "C with Classes" in 1979; it was renamed C++ in 1983 and released commercially in 1985.
Why it matters: C++ brought classes and objects to C-style syntax, an approach that Java followed in a simpler, safer form.
The name uses C's increment operator ++, the same operator taught with Java's loops. C++ is widely used for systems, games and performance-critical software.
Dan Bricklin & Bob Frankston
VisiCalc · 1979
Created VisiCalc (1979) for the Apple II, the first electronic spreadsheet program for personal computers.
Why it matters: Rows, columns, cell references and automatic recalculation, the basis of Excel in Chapter 3, start with VisiCalc.
Bricklin had the idea as a Harvard Business School student; Frankston wrote most of the code. VisiCalc made many people buy a personal computer just to run it.
Richard Stallman
GNU project · 1983 · GPL
Announced the GNU project in 1983 to build a free Unix-like operating system and founded the Free Software Foundation (1985).
Why it matters: The licensing and open-source topics of Chapters 1 and 2 build on the free-software movement he started.
The GNU General Public License (1989) lets anyone use, study, change and share software as long as modified versions stay under the same terms. Linux systems combine the Linux kernel with GNU tools.
Bill Gates & Paul Allen
Microsoft · 1975 · MS-DOS · Windows
Founded Microsoft in 1975, supplied MS-DOS for the IBM PC (1981) and released Windows 1.0 in 1985.
Why it matters: Windows and Microsoft Office, the software of Chapters 2 and 3, come from the company they built.
Their first product was a BASIC interpreter for the Altair 8800. MS-DOS was based on 86-DOS, bought from Seattle Computer Products. The Office suite was first bundled around 1990.
Tim Berners-Lee
World Wide Web · 1989
Proposed the World Wide Web at CERN in 1989 and created the first web browser, web server, HTML and HTTP; the first website went online in 1991.
Prizes: Turing Award 2016
Why it matters: The web is a service running on top of the internet; URLs, HTTP and browsers in Chapter 1 are his design.
CERN made the web technology freely available in 1993, which helped it spread quickly. He founded the World Wide Web Consortium (W3C) in 1994.
James Gosling
Java · 1995
Led the design of the Java language at Sun Microsystems, released in 1995 with the slogan "write once, run anywhere".
Why it matters: Java is the language of Chapters 5 to 12: source code is compiled by javac into bytecode, which the JVM runs on any platform.
The language began in 1991 as Oak in Sun's Green project for consumer devices. Sun was acquired by Oracle in 2010, which now maintains Java.
Guido van Rossum
Python · 1991
Created Python, first released in February 1991, with an emphasis on readable code.
Why it matters: Python is the course's example of an interpreted (bytecode plus virtual machine) language beside compiled C and hybrid Java.
Python uses indentation to mark blocks instead of braces. He led the language as its "Benevolent Dictator For Life" until 2018.
Jeannette Wing
"Computational Thinking" · 2006
Argued in a 2006 Communications of the ACM essay that computational thinking is a basic skill for everyone, not only for computer scientists.
Why it matters: Her essay is a source of the computational thinking chapter: decomposition, pattern recognition, abstraction and algorithm design.
She has also worked on formal methods; the Liskov–Wing substitution principle (1994) is a rule of object-oriented design. She later headed the computer science directorate of the US National Science Foundation and was a vice president at Microsoft Research.
Linus Torvalds
Linux kernel · 1991 · Git
Started the Linux kernel as a student in Helsinki in 1991 and released it as open-source software.
Why it matters: Linux is the kernel behind Android, most web servers and supercomputers; Chapter 2 separates the kernel from a full distribution.
He announced the project on 25 August 1991 as "just a hobby". In 2005 he created Git, the version control system now used for most software development.
Joe Becker, Lee Collins & Mark Davis
Unicode · 1987–91
Began the Unicode project in 1987 to give every character in every writing system a single code; Becker's 1988 paper "Unicode 88" set out the design.
Why it matters: Java's char and String are based on Unicode, so 'A' is 65 and Turkish letters like ğ (U+011F) can be stored and compared.
Becker and Collins worked at Xerox and Davis at Apple; the Unicode Consortium was incorporated in 1991 and Unicode 1.0 appeared that year. UTF-8 (1992), designed by Ken Thompson and Rob Pike, became the dominant encoding.
No profile matches your search or filter.
Prize years refer to the year of the award; the Turing Award is given by the ACM. Joint cards group people whose work is taught together and are sorted by the first person named; where no birth year is shown, sorting uses the period of the main work.