← all systems · see it in The System
Computer science (the field: the practice and the computation it studies)
Computer science is the study of computation, information, and automation, together with their associated phenomena.
Properties published scienceour proposal
Sourced fields, and our own readings.
| born at | booked: the 1950s-60s discipline (Cambridge diploma 1953, Purdue department 1962); its formal core 1936 |
| born precision | decades |
| boundary | Inside: the practice of studying information processes and what can be automated (theory, abstraction and design: Denning's working group's three paradigms), the people, departments, conferences and papers that carry it, and the computation it studies (models of computation, algorithms, their limits). Outside: the machines themselves (computer, software, hardware engineering, which it studies and designs but which are their own systems), the other fields it serves, and the natural information processes it models. |
| nested level | A discipline among the sciences (part inside a whole: 'Included broadly in the sciences'). It runs on people (human L6-L7: thought, language, notation) and on computers (computer L7: programs run). The computation it studies is structure booked in roles. |
| scale | social |
Measures (21) published science
| component doubling period (Moore 1965) | about 1 year |
| component doubling period (Moore's 1975 revision) | about 2 (a compound annual growth rate of 41%) years |
| components per chip forecast for 1975 | 65 000 components |
| Landauer bound per erased bit | kT ln 2 energy (k Boltzmann's constant, T temperature) |
| random 3-SAT threshold (cavity method) | 4.267 clauses per variable |
| onset of the hard-SAT phase | 3.921 clauses per variable |
| rigorous bounds on the 3-SAT threshold (2002) | 3.26 < αc < 4.506 clauses per variable |
| P vs NP poll 2002 | 61 said P ≠ NP, 9 said P = NP respondents |
| P vs NP poll 2012 | 126 said P ≠ NP, 9 said P = NP respondents |
| Amdahl limit at 95% parallel work | 20 times speedup |
| Brooks's threshold for a tenfold gain from removing accidental work | more than 9/10 fraction of effort |
| women's share of CS graduates at its peak (1984) | around 37 percent |
| people proficient at programming | an estimated 0.5 percent of world population |
| expert programmers' experience in the fMRI study | average 11 years |
| Turing Award recipients (as of 2026) | 81 people |
| Turing Award prize since 2014 | 1 million US dollars |
| basic instructions in Turing's insight | 5 instructions |
| ways of combining instructions (Böhm-Jacopini) | 3 rules |
| first CS degree program | 1953 year |
| first US CS department | 1962 year |
| for/if decoding accuracy in IPS | 67.4 percent |
Open contentions (7) open contention
Where sources or readings disagree. Both stay on the map.
- C-413 Where do thoughts come from?
booked: No theory is proven, so the map lists the main ones side by side and doesn't pick one. It shows where thinking is handled in the brain, not where thoughts start.
the other reading: see C-413 - C-557 Can every computation be done by a Turing machine?
booked: The map follows the near-universal acceptance of the Church-Turing thesis and notes that it can't be proven, keeping the challenges alongside.
the other reading: see C-557 - C-596 What is a computer, and is the brain one?
booked: The map uses the everyday sense, a human-made machine programmed to carry out arithmetic or logical steps, and keeps the broader sense in which brains count as computers alongside.
the other reading: see C-596 - C-722 Does erasing information always cost energy (Landauer's principle)?
booked: The map follows the principle: erasing a bit costs a minimum amount of heat, while reversible steps can in principle avoid it. The objections are kept alongside.
the other reading: see C-722 - C-2259 When did computer science begin?
booked: The map books the 1950s-60s discipline and keeps earlier starts beside it.
the other reading: algorithms since antiquity (rung 11); Babbage and Lovelace (1843, 'first published algorithm ... for implementation on a computer'); Turing and Church 1936, the formal core; Leibniz, 'may be considered the first computer scientist' - C-2260 Is computer science a science?
booked: The map keeps the readings: science, mathematics, engineering or art.
the other reading: a mathematical discipline (Dijkstra, Hoare: programs as mathematical sentences); an engineering discipline (reliability studied like bridges; Parnas: software engineering separate); not a science at all ('Computer science is not a science', Abelson and Sussman, quoted in Denning 2005); an art (Graham's 'hacking', quoted in Denning 2005) - C-2298 Does P equal NP?
booked: The map books it as open, with most theorists expecting P ≠ NP.
the other reading: P = NP (Knuth's professed belief; 9 respondents in each Gasarch poll); agnostic (Lipton)
Partners and parts published science
Built from / builds (8)
- Algorithm (the practice of step-by-step procedures and the structure they compute)
- Turing machine: the abstract machine that reads and writes one symbol at a time on an unbounded tape by a finite table of rules, the model of computation of logic and computer science
- Programming language
- Data structure
- Theory of computation (computability and complexity)
- Computer scientists (the practitioners)
- Conferences (the field's main publication channel)
- Conference papers against journals for the field's prestige
Sits inside / holds (9)
- Recursion: defining or computing a thing in terms of smaller versions of itself, as computer science and mathematics describe it, with its base cases, call stack, recursive data, induction, and its sightings in language and nature
- Turing machine: the abstract machine that reads and writes one symbol at a time on an unbounded tape by a finite table of rules, the model of computation of logic and computer science
- Software engineering
- Compiler
- Science (as a human social and cultural system)
- Human society (from local community up to societies)
- Data structure
- Graph theory: the practice of studying vertices joined by edges (problems, proofs, algorithms, its people and books) and the graphs it works on
- Sorting algorithm
Trades with (valence) (29)
- Mathematics (the field: the practice and the structures it studies) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Turing machine: the abstract machine that reads and writes one symbol at a time on an unbounded tape by a finite table of rules, the model of computation of logic and computer science via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Software engineering via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- Compiler via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- Logic: the study and practice of correct reasoning (formal and informal, across its traditions) and the valid inference it works on, together with how people actually reason via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- History of science (the field and the story it tells) via sys:written-record · Computer science (the field: the practice and the computation it studies) even
- DNA and genes via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Thermal energy (heat, temperature and heat flow) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) loss
- Human (Homo sapiens) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Engineering (design) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Software via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Internet via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Large language model via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Computer via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Algorithm (the practice of step-by-step procedures and the structure they compute) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Operating system via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Programming language via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Cryptography via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Artificial intelligence via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Database via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Data structure via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- Mathematical proof: the practice of showing that a statement follows from axioms and earlier theorems, how it is written, checked (by people and machines) and accepted, and the derivations it works on via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- Combinatorics: the practice of counting, arranging and choosing finite structures (permutations, combinations, partitions, designs, graphs), the structures it studies, and the people and machines who work with them via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Philosophy (the field: the practice and the questions it works on) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Metaphysics (the branch of philosophy: its practice and the questions about reality it works on) via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Graph theory: the practice of studying vertices joined by edges (problems, proofs, algorithms, its people and books) and the graphs it works on via sys:written-record · Computer science (the field: the practice and the computation it studies) gain
- Sorting algorithm via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
- Truth via sys:sensory-environment · Computer science (the field: the practice and the computation it studies) gain
expressed by (15)
- Generation/Synthesis
- Recombination/Composition
- Scaffolding/Enablement (Meta-Tooling)
- Templating / Standardization
- Interoperability/Transduction (Bridging)
- Encapsulation & Modularity (Abstraction)
- Amplification/Scale-Up (Manufacture & Distribution)
- Distributed Autonomy/Decentralized Execution (Subsidiarity)
- Hypothesis/Goal Selection
- Search/Foraging
- Mapping/Modeling
- Active Experimentation / Probing (Optimal Experimental Design)
- Social Learning / Public Information Use
- Validation of Effectiveness
- Quality Control & Error Correction
floor filled by (19)
- Turing machine: the abstract machine that reads and writes one symbol at a time on an unbounded tape by a finite table of rules, the model of computation of logic and computer science
- DNA and genes
- Human (Homo sapiens)
- Engineering (design)
- Human brain
- Mathematics (the field: the practice and the structures it studies)
- Computer
- Algorithm (the practice of step-by-step procedures and the structure they compute)
- Programming language
- Software engineering
- Information theory
- Computer hardware
- Data structure
- Theory of computation (computability and complexity)
- Mathematical logic: the field that studies logic within mathematics (model theory, proof theory, set theory, computability theory) and the formal systems, structures and limit results it works on
- Combinatorics: the practice of counting, arranging and choosing finite structures (permutations, combinations, partitions, designs, graphs), the structures it studies, and the people and machines who work with them
- Metaphysics (the branch of philosophy: its practice and the questions about reality it works on)
- Graph theory: the practice of studying vertices joined by edges (problems, proofs, algorithms, its people and books) and the graphs it works on
- Sorting algorithm
represents (1)
Kinds (15)
- Cryptography
- Software engineering
- Artificial intelligence
- Computational science
- Theoretical computer science
- Applied computer science
- Informatics / datalogy (the European naming)
- Computer engineering
- Information technology / information systems
- Data science
- Human-computer interaction
- Concurrent, parallel and distributed computing
- Computer graphics and visualization
- Computer architecture
- DNA computing (unconventional computing)
Notes published science
- Your brain reads code with its puzzle-solving and logic machinery, not its language machinery: in fMRI the language network answered code 'weakly or not at all', while the networks for formal logic and hard problems lit up, even for kids' picture-block code (src:ivanova-2020, src:liu-2020).
- Forgetting costs energy: erasing one bit must dump at least kT ln 2 of entropy as heat, but any computation can in principle be done without that toll if it keeps a copy of its input. The physicist who wrote the notes defending this, Charles Bennett, won computer science's top prize, the Turing Award, for 2025 (src:bennett-2003, src:wp:turing-award).
- Random logic puzzles freeze like water: as you add constraints to a random 3-SAT puzzle, it goes from almost surely solvable to almost surely unsolvable at about 4.27 constraints per variable, and the hardest puzzles crowd just before that edge (src:mezard-zecchina-2002).
Layers
The ways it takes in its world, where they meet, and how it acts back, each from L1 (where it meets the world) up.
information processes in the world, natural and artificial, up to the systems computer scientists design and the question what can be automated (reader's view)
- L1: Information processes in the world, natural and artificial, on any physical carrier: bistable electronic states, gears, DNA strands, people with paper
- L2: Representation: information as symbols, ultimately 0 and 1; codes and channels (information and coding theory)
- L3: Machines and models of computation: the Turing machine (a person computing with paper, made exact), the universal machine, real computers as instruments
- L4: Abstraction and modelling: programs, languages, data structures, models of problems; the paradigm of abstraction
- L5: Algorithms and their analysis: three combining forms, time and space costs, complexity classes, distributed algorithms
- L6: Theory: what can and cannot be computed (undecidability), what can be done efficiently (P vs NP), the accepted body of results and the subfields
- L7: Design and purpose: systems built and deployed; the field's question 'What can be (efficiently) automated?'; computational thinking carried into every field
the boardroom (shared floors)
- L4: Abstraction and modelling: where inputs become models (programs, data structures, representations); in people, the multiple-demand and fronto-parietal networks that carry code
- L5: Algorithms and analysis: control structures, costs, complexity, distributed algorithms
- L6: Theory and the body of knowledge: computability, complexity, the accepted results and the subfields
- L7: Design and purpose: what to build and automate; the field's question
way in: Hardware supply: devices from physics and engineering (Moore's law)
- L1: Integrated circuits whose component counts doubled every year, then every two; adders and their carries
- L2: Industry roadmaps set by the trend; the end of Dennard scaling in the mid-2000s
- L3: Machine organisation and architecture: what hardware offers programs
way in: Machines in operation: runs, measurements, benchmarks, test results
- L1: A machine or program running, posed as a question to nature
- L2: Observation and measurement of the machine in operation
- L3: Performance of real algorithms on real data, fitted to cost models
way in: Natural information processes: DNA, cells, brains, quantum systems
- L1: DNA read as encoded information; physics' quantum information processes
- L2: DNA taken up as a computing material
- L3: Adleman's 1994 Hamiltonian path computation in DNA
way in: Problems brought from the world and other fields
- L1: Problems from physics, biology, chemistry, industry (flight scheduling, decryption, drug design)
- L2: Reformulation: reduction, embedding, transformation, simulation
- L3: A representation chosen so the problem becomes tractable
way in: Sight: code, notation and diagrams on screens and paper
- L1: Code as text (Python) or as images (ScratchJr blocks) on a screen
- L2: Early visual cortex and ventral stream take in the look of the code
way in: Society: demand, funding, institutions and who enters the field
- L1: Demand and problems named by institutions (NATO's 1967 study group on computer science); a growing job market; 0.5% of people program
- L2: Who enters: the women's share of CS graduates peaked about 37% in 1984 then declined; a 1960s aptitude test selected mostly men
- L3: Departments, degrees, awards: Cambridge 1953, Purdue 1962; the Turing Award
way in: The literature and the community: conference papers, journals, talks (sight and hearing)
- L1: Conference papers (more prestigious than journals here), journals, talks where researchers 'present their recent work and meet'
- L2: Rapid review and distribution of results
- L3: Propositions argued, tested and either accepted or refuted
way in: Thought: reasoning about programs and problems (the inner channel)
- L1: A problem held in mind with its unknowns: how hard is it, what is the best way
- L2: Rules applied to arbitrary symbols in a left-lateralized fronto-parietal network shared with formal logic
- L3: A recent cultural tool carried on general-purpose (multiple-demand) machinery, not on a dedicated code system
way out: Automation deployed into the world (networks, AI, security, simulation)
- L1: The systems act on the world
- L7: Evaluative and predictive tasks automated
way out: Heat: the entropy every irreversible computation exports
- L1: Heat dissipated into the environment
- L6: Logically irreversible steps (erasure, merging paths)
way out: Papers, proofs and talks
- L1: Conference and journal papers
- L6: A result: theorem, algorithm, measurement
way out: Programs and systems built and run
- L1: Run on a machine
- L4: Expressed in a programming language; compilers bootstrapped in their own language
- L7: A system designed for a purpose
way out: Teaching and computational thinking carried to others
- L1: Degree programs, courses, curricula
- L7: The aim: computational thinking for everyone
Sources (36) published science
Bootstrapping (compilers) (Wikipedia, rev 1323208297, 2025-11-20, via Wikimedia Enterprise) (behind its links)
Moore's law (Wikipedia, WME snapshot) (behind its links)
Denning, Is Computer Science Science?, Comm. ACM 48(4):27-31 (2005), doi:10.1145/1053291.1053309 (author's copy) (behind its links)
Wing, Computational Thinking, Comm. ACM 49(3):33-35 (2006), doi:10.1145/1118178.1118215 (course copy) (behind its links)
Women in computing (Wikipedia, via Wikimedia Enterprise) (behind its links)
Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc. 2-42 (1936-37), doi:10.1112/plms/s2-42.1.230 (open copy, OCR text) (behind its links)
Moore, Cramming more components onto integrated circuits, Electronics 38(8) (19 April 1965) (behind its links)
Bennett CH (2003) Notes on Landauer's principle, reversible computation, and Maxwell's Demon. Stud Hist Philos Mod Phys 34:501-510. arXiv:physics/0210005 (behind its links)
Mézard & Zecchina, The random K-satisfiability problem: from an analytic solution to an efficient algorithm, Phys. Rev. E 66 (2002), arXiv:cond-mat/0207194 (behind its links)
Aaronson, P =? NP (survey, 2017 version), in Open Problems in Mathematics, Springer (2016) (behind its links)
Amdahl's law (encyclopedia) (behind its links)
Brooks, No Silver Bullet: Essence and Accidents of Software Engineering, UNC technical report TR86-020 (1986) (behind its links)
Turing Award (Wikipedia, via Wikimedia Enterprise) (behind its links)
Ivanova et al., Comprehension of computer code relies primarily on domain-general executive brain regions, eLife 9:e58906 (2020), doi:10.7554/eLife.58906, CC BY (behind its links)
Recursion (computer science) (Wikipedia, via Wikimedia Enterprise snapshot 2026-10-01) (behind its links)
Turing machine (Wikipedia, rev 1380238390, 2026-10-14, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Software engineering (Wikipedia, Wikimedia Enterprise snapshot 2026-11-01 via tools/wme) (behind its links)
Compiler (Wikipedia, rev 1373605841, 2026-09-06, via Wikimedia Enterprise) (behind its links)
Pat Morin, Open Data Structures (Java edition), open textbook, CC BY (opendatastructures.org) (behind its links)
Graph theory (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Sorting algorithm (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Fan et al., A high-resolution summary of Cambrian to early Triassic marine invertebrate biodiversity, Science 367, 272-277 (2020), doi:10.1126/science.aax4953 (cited) (behind its links)
Naur & Randell (eds.), Software Engineering: Report on a conference sponsored by the NATO Science Committee, Garmisch, 1968 (published 1969) (behind its links)
Mathematics (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
De Mol, L. Turing Machines. Stanford Encyclopedia of Philosophy (first published 24 Sep 2018; substantive revision 21 May 2025) (behind its links)
History of compiler construction (Wikipedia, via Wikimedia Enterprise) (behind its links)
Logic (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
History of science (Wikipedia, rev 1379869734, 2026-10-12, via Wikimedia Enterprise) (behind its links)
Curry–Howard correspondence (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Mathematical logic (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Combinatorics (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01) (behind its links)
Philosophy (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Metaphysics (encyclopedia article, WME snapshot 2026-11-01) (behind its links)
Truth (encyclopedia article, WME snapshot 2026-11-01) (behind its links)