EVOPEDIA

← 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 atbooked: the 1950s-60s discipline (Cambridge diploma 1953, Purdue department 1962); its formal core 1936
born precisiondecades
boundaryInside: 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 levelA 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.
scalesocial

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 197565 000 components
Landauer bound per erased bitkT 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 phase3.921 clauses per variable
rigorous bounds on the 3-SAT threshold (2002)3.26 < αc < 4.506 clauses per variable
P vs NP poll 200261 said P ≠ NP, 9 said P = NP respondents
P vs NP poll 2012126 said P ≠ NP, 9 said P = NP respondents
Amdahl limit at 95% parallel work20 times speedup
Brooks's threshold for a tenfold gain from removing accidental workmore than 9/10 fraction of effort
women's share of CS graduates at its peak (1984)around 37 percent
people proficient at programmingan estimated 0.5 percent of world population
expert programmers' experience in the fMRI studyaverage 11 years
Turing Award recipients (as of 2026)81 people
Turing Award prize since 20141 million US dollars
basic instructions in Turing's insight5 instructions
ways of combining instructions (Böhm-Jacopini)3 rules
first CS degree program1953 year
first US CS department1962 year
for/if decoding accuracy in IPS67.4 percent

Open contentions (7) open contention

Where sources or readings disagree. Both stay on the map.

Partners and parts published science

Built from / builds (8)

Sits inside / holds (9)

Trades with (valence) (29)

expressed by (15)

floor filled by (19)

represents (1)

Kinds (15)

Notes published science

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)

  1. L1: Information processes in the world, natural and artificial, on any physical carrier: bistable electronic states, gears, DNA strands, people with paper
  2. L2: Representation: information as symbols, ultimately 0 and 1; codes and channels (information and coding theory)
  3. L3: Machines and models of computation: the Turing machine (a person computing with paper, made exact), the universal machine, real computers as instruments
  4. L4: Abstraction and modelling: programs, languages, data structures, models of problems; the paradigm of abstraction
  5. L5: Algorithms and their analysis: three combining forms, time and space costs, complexity classes, distributed algorithms
  6. 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
  7. 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)

  1. L4: Abstraction and modelling: where inputs become models (programs, data structures, representations); in people, the multiple-demand and fronto-parietal networks that carry code
  2. L5: Algorithms and analysis: control structures, costs, complexity, distributed algorithms
  3. L6: Theory and the body of knowledge: computability, complexity, the accepted results and the subfields
  4. 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)

  1. L1: Integrated circuits whose component counts doubled every year, then every two; adders and their carries
  2. L2: Industry roadmaps set by the trend; the end of Dennard scaling in the mid-2000s
  3. L3: Machine organisation and architecture: what hardware offers programs

way in: Machines in operation: runs, measurements, benchmarks, test results

  1. L1: A machine or program running, posed as a question to nature
  2. L2: Observation and measurement of the machine in operation
  3. L3: Performance of real algorithms on real data, fitted to cost models

way in: Natural information processes: DNA, cells, brains, quantum systems

  1. L1: DNA read as encoded information; physics' quantum information processes
  2. L2: DNA taken up as a computing material
  3. L3: Adleman's 1994 Hamiltonian path computation in DNA

way in: Problems brought from the world and other fields

  1. L1: Problems from physics, biology, chemistry, industry (flight scheduling, decryption, drug design)
  2. L2: Reformulation: reduction, embedding, transformation, simulation
  3. L3: A representation chosen so the problem becomes tractable

way in: Sight: code, notation and diagrams on screens and paper

  1. L1: Code as text (Python) or as images (ScratchJr blocks) on a screen
  2. 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

  1. L1: Demand and problems named by institutions (NATO's 1967 study group on computer science); a growing job market; 0.5% of people program
  2. L2: Who enters: the women's share of CS graduates peaked about 37% in 1984 then declined; a 1960s aptitude test selected mostly men
  3. 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)

  1. L1: Conference papers (more prestigious than journals here), journals, talks where researchers 'present their recent work and meet'
  2. L2: Rapid review and distribution of results
  3. L3: Propositions argued, tested and either accepted or refuted

way in: Thought: reasoning about programs and problems (the inner channel)

  1. L1: A problem held in mind with its unknowns: how hard is it, what is the best way
  2. L2: Rules applied to arbitrary symbols in a left-lateralized fronto-parietal network shared with formal logic
  3. 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)

  1. L1: The systems act on the world
  2. L7: Evaluative and predictive tasks automated

way out: Heat: the entropy every irreversible computation exports

  1. L1: Heat dissipated into the environment
  2. L6: Logically irreversible steps (erasure, merging paths)

way out: Papers, proofs and talks

  1. L1: Conference and journal papers
  2. L6: A result: theorem, algorithm, measurement

way out: Programs and systems built and run

  1. L1: Run on a machine
  2. L4: Expressed in a programming language; compilers bootstrapped in their own language
  3. L7: A system designed for a purpose

way out: Teaching and computational thinking carried to others

  1. L1: Degree programs, courses, curricula
  2. L7: The aim: computational thinking for everyone

Sources (36) published science

Computer science (Wikipedia, via Wikimedia Enterprise snapshot 2026-11-01)
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)
Liu, Kim, Wilson & Bedny, Computer code comprehension shares neural resources with formal logical inference in the fronto-parietal network, eLife 9:e59340 (2020), doi:10.7554/eLife.59340, CC BY (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)