EVOPEDIA

← all systems · see it in The System

Stored-program principle (instructions held in the same memory as data)

A stored-program computer is a computer that reads the program instructions it is executing directly from fast electronic storage ... The definition is often extended with the requirement that the treatment of programs and data in memory be interchangeable or uniform.

Properties published scienceour proposal

Sourced fields, and our own readings.

aliasesThe stored-program computer
arrivesconcept 1936 (Turing; Zuse's patent applications); first stored program run by the Manchester Baby, 21 June 1948 (ENIAC modified, 12 April 1948)
boundaryInside: the generative rule (a program's instructions are words held in the same fast store as its data, read and written by the same mechanism, so programs can be read, written, copied and run by programs), its quanta (the stored instruction word and the instruction set it is written in) and its shell (restrictions on which stored words may be modified or executed: von Neumann's address-field-only overwrite, tagged descriptors, non-executable pages). Outside: the machines that carry it (the computer's organs, the memory devices), the code alphabet (binary or decimal), and everything it unpacks (programs, languages, compilers, operating systems, viruses, virtual machines, evolutionary computation).
nested levelA rule first written as mathematics (Turing 1936: the action table on the same tape as the data), run on machines from 1948 (ENIAC function tables 12 April; Manchester Baby 21 June). Built from the instruction word and the instruction set, with a shell. Embedded in the stored-program computer and its memory (mercury delay lines, Williams tubes), and SEED_WITHIN writing (the description is a written record that a reader acts on). Its words are usually binary (positional notation), but ENIAC's were decimal.
quantumthe program held as data in the same fast memory, so instructions are copyable, editable symbols (traced to the 1936 universal Turing machine)
scaletechnological

Measures (22) published science

concept: universal machine with instructions on the data tape (Turing)1936-1937 date
instructions in data storage anticipated in two patent applications (Zuse)1936 year
Eckert and Mauchly write about the stored-program conceptDecember 1943 date
First Draft of a Report on the EDVAC1945 year
first electronic stored program run (Manchester Baby)21 June 1948 date
ENIAC first stored program run12 April 1948 (src:wp:stored-program-computer); demonstrated 16 September 1948 (src:wp:von-neumann-architecture) date
gap from concept to first runabout 12 (1936 to 1948) years
Baby store32 words of 32 bits (1,024 bits)
Baby instruction set7 operations in a 3-bit field (8 possible)
first program17 instructions, about 3.5 million operations, 52 minutes instructions / operations / minutes
characteristic clock: Baby memory access (read, write or refresh one word)360 microseconds
characteristic clock: Baby instruction execution rateabout 700 (an instruction takes four times a word access) instructions per second
characteristic clock: main-store refresh cycle20 milliseconds
Williams-tube charge lifetime before refreshabout 0.2 seconds
Williams tube capacity, autumn 19472,048 bits held for four hours bits / hours
ENIAC function-table program store3,600 decimal digits
time to set up and debug a program on ENIAC before the rulethree weeks time
first mass-produced stored-program machines (Bull Gamma 3, IBM 650)about 1200 and 2000 units sold
smallest known standard universal Turing machine (Rogozhin 4-state 6-symbol)22 instructions
programming languages createdthousands (no exact figure in the source) languages
Genetic Programming Bibliographymore than 10,000 entries
characteristic clock: memory-protection hardening after a new attack classBurroughs 5000 tags 1961; Exec Shield 2003; Linux NX August 2004 dates

Cross-scale patterns seen here (7) our proposal

Shapes that recur when the same kind of problem is solved at different scales, and how each shows in Stored-program principle (instructions held in the same memory as data). Each links to every other system that shows it.

Valence: what it trades, and with whom (13) published science

Each exchange with a neighbour, read from both sides: who gains, who pays, and what carries it.

Partners and parts published science

Built from / builds (6)

Sits inside / holds (4)

expressed by (15)

floor filled by (7)

represents (1)

seed within (2)

Kinds (2)

wired (1)

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.

acoustic delay line: bits as sound pulses recirculating in mercury

  1. L1: Sound in a liquid metal column: 'data was stored as a sequence of acoustic waves propagated through a mercury column'; glass, quartz, steel and lead were also tried
  2. L2: Restoration: 'an amplifier and a pulse shaper are connected between the output of the delay line and the input ... removing any degradation due to losses in the medium'
  3. L3: Words as timed places in the pulse train: 'The memory capacity equals the recirculation time divided by the time to transmit one bit'; Eckert, January 1944: 'store data and programs in a new addressable memory device, a mercury metal delay-line memory'

digital electronics: words in fast electronic store (instructions and data alike)

  1. L1: Charge on a cathode-ray tube face: 'A dash generated a positive charge, and a dot a negative charge ... a negative charge represented 0, and a positive charge 1'; later voltages in circuits
  2. L2: The bit read and refreshed: 'picked up by a detector plate in front of the screen'; 'The charge dissipated in about 0.2 seconds, but it could be automatically refreshed'
  3. L3: The stored word, instruction or datum alike: 'Each 32-bit word of RAM could contain either a program instruction or data'; bits 0-12 operand address, bits 13-15 operation
  4. L4: The program: 'a set of instructions (a program) that details the computation'; the first program was 17 instructions plus eight words of working storage
  5. L5: Fetch and execute: 'A central control unit to sequence operations performed by the machine'; a third tube held 'the current program instruction along with its address'; conditional skip and jumps
  6. L6: The shell and the tool floor: tagged descriptors (Burroughs 5000, 1961) and non-executable pages; 'assemblers, compilers, linkers, loaders, and other automated programming tools'
  7. L7: The field's stated purpose: 'It makes "programs that write programs" possible. This has made a sophisticated self-hosting computing ecosystem flourish'

mental representation: the human computer following instructions

  1. L1: The human computer's states of mind: Turing compared 'a human in the process of computing a real number to a machine that is only capable of a finite number of conditions', the m-configurations
  2. L5: Following written instructions: 'a person he called a "computer", who acted according to the instructions provided by a tape'

written record: the machine's description on tape and the program text

  1. L1: A tape of squares: 'a tape on which symbols could be read and written sequentially as the tape moved under a tape head'; before the rule, programs on 'punched tape, which was physically fed into the system'
  2. L2: Symbols: Turing 'used seven symbols { A, C, D, R, L, N, ; } to encode each 5-tuple'; 'every Turing machine can be encoded as a string over the alphabet {0, 1}'
  3. L3: The action table as a string on the same tape as the input: 'placing the "action table" -- the instructions for the machine -- in the same "memory" as the input data'
  4. L4: Whole machine descriptions: Penrose's U-machine code 'an enormous number that spans almost 2 full pages of 1's and 0's'; Rogozhin's (4, 6) machine 'uses only 22 instructions'
  5. L5: Program text translated by programs: Autocode for the Manchester Mark I (1952); 'In 1957, they completed a FORTRAN compiler'

Who fills each layer

Sources (20) published science

Stored-program computer (Wikipedia via Wikimedia Enterprise, cached research/showcase/cache/wme)
Programming language (Wikipedia via Wikimedia Enterprise, cached research/showcase/cache/wme)
Manchester Baby (Wikipedia, rev 1375332732, 2026-09-17, via Wikimedia Enterprise) (behind its links)
Delay-line memory (Wikipedia, rev 1365416787, 2026-07-22, via Wikimedia Enterprise) (behind its links)
Von Neumann architecture (Wikipedia, rev 1381757639, 2026-10-24, via Wikimedia Enterprise) (behind its links)
Executable-space protection (Wikipedia, rev 1332700931, 2026-01-13, via Wikimedia Enterprise) (behind its links)
Computer virus (Wikipedia, rev 1373473633, 2026-09-06, via Wikimedia Enterprise) (behind its links)
Universal Turing machine (Wikipedia, rev 1377070305, 2026-09-27, via Wikimedia Enterprise) (behind its links)
Haigh T., Priestley M., Rope C. (2014) Reconsidering the Stored-Program Concept. IEEE Annals of the History of Computing 36(1): 4-17 (authors' open copy) (behind its links)
Internet protocol suite (Wikipedia via Wikimedia Enterprise, cached research/showcase/cache/wme) (behind its links)
Harvard architecture (Wikipedia, rev 1345121153, 2026-03-24, via Wikimedia Enterprise) (behind its links)
Von Neumann universal constructor (Wikipedia, rev 1373003337, 2026-09-03, via Wikimedia Enterprise) (behind its links)
Genetic programming (Wikipedia, rev 1369585575, 2026-08-15, via Wikimedia Enterprise) (behind its links)
Bootstrapping (compilers) (Wikipedia, rev 1323208297, 2025-11-20, via Wikimedia Enterprise) (behind its links)
Self-modifying code (Wikipedia, rev 1374727297, 2026-09-13, via Wikimedia Enterprise) (behind its links)
Williams tube (Wikipedia, rev 1369816839, 2026-08-17, via Wikimedia Enterprise) (behind its links)
Binary number (Wikipedia, rev 1378219065, 2026-10-03, via Wikimedia Enterprise) (behind its links)
Algorithm (encyclopedia, Wikimedia Enterprise 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)
Compiler (Wikipedia, rev 1373605841, 2026-09-06, via Wikimedia Enterprise) (behind its links)