All lessons Leer en español

History · Unit 06

How computers got here

Follow the ideas that connect mechanical calculation, stored programs, shared machines, personal devices, and cloud systems.

7 minready

Helpful before thisWhere hacking comes from

After this lesson you can

  • explain stored programs without assuming instructions and data must share one memory
  • describe a simplified instruction cycle and the roles of memory and storage
  • connect changing computer scale to changing protection and maintenance needs

Lessons in this unit

Browse 4 lessons in this topic
  1. From punched cards to stored programsDiscover why recording data, representing instructions, and protecting changes are three different problems.7 min
  2. From transistors to personal computersFollow the shift from scarce shared equipment to personal machines, and discover who inherited the maintenance work.7 min
  3. From packet switching to the WebSeparate the network that carries information from the Web that makes linked information accessible.7 min
  4. Virtualization and the cloudSee how an old resource-sharing idea became on-demand infrastructure, with new management responsibilities.7 min

Explore the eras below. On wider screens, scroll sideways to see the full timeline.

The computer in a phone and the machines used for early scientific calculation look very different. They share a useful idea: represent a procedure so a machine can carry it out. The history is a series of changes in how instructions are represented, where data lives, who shares resources, and how people control the work.

Four turning points worth exploring

This overview gives you the connections. Each short chapter below follows a change in enough detail to explain why it matters today:

These changes overlapped. A mainframe did not vanish because a personal computer appeared; a new interface could coexist with older hardware, institutions, and software. History is most useful when it explains the choices people faced, not when it presents a parade of machines that supposedly replaced one another overnight.

Stored instructions need not share a data storeInstruction storage and data storage may be separate. A processor reads instructions and works with data; an instruction may change registers, flags, control flow, or memory.InstructionstorageDatastorageProcessorRead, decode, executePossible state changesRegisters / flags / memoryControl flow
A simplified processor obtains instructions, interprets them, and performs operations. Instructions and data are shown separately because stored-program operation does not require one unified memory.

Procedures before electronics

Mechanical calculating devices made repeated arithmetic easier. Charles Babbage’s nineteenth-century Analytical Engine design described a “store” and a “mill,” with operations directed by punched cards; the complete machine was not built in his lifetime. Later tabulating equipment helped process large collections of records.

Turing’s 1936 work addressed what a formal computing procedure can calculate. It was a mathematical contribution, not a blueprint for every modern processor. Historical designs and theories solved different problems and should not be collapsed into one invention story.

Electronics and stored instructions

Colossus supported wartime cryptanalysis. ENIAC emerged from wartime work on calculation and was publicly presented in 1946. Their purposes, programmability, and early configuration methods differed.

A Stored program keeps executable instructions in storage the machine can use, so changing tasks need not require rewiring. The Manchester Baby ran a stored program in 1948, an important experimental milestone.

Stored programs do not require instructions and data to occupy the same physical memory or unrestricted address space. Harvard-style arrangements separate instruction and data storage or paths; modern designs can combine ideas. Memory protection and executable-page policies also determine which regions may be used for which operations.

A useful processor model

The simplified Instruction cycle is fetch, decode, and execute. A program counter helps track instruction flow. Results may update registers, flags, memory, or control flow; not every instruction writes main memory. Modern processors may pipeline and reorder work while preserving the architecture’s required observable behavior.

A memory-safety defect is therefore not an inevitable consequence of storing instructions. Its effects depend on the error, accessible state, program behavior, and protections. Reliable boundaries distinguish authorized updates from unintended changes.

Sharing machines, then distributing them

Mainframes supported large workloads, batch processing, and, in some systems, time-sharing. Minicomputers made computing accessible to more departments and laboratories. A Microprocessor integrated processor functions into chips; falling cost and supporting components helped personal computing expand, but low price is not its definition.

Registers and caches support fast execution; working memory holds active state; persistent storage keeps information across power cycles under normal conditions. Copies in caches, temporary files, backups, and hibernation images each need appropriate protection. A secret does not stop being sensitive when its location changes.

Phones and cloud keep the underlying questions

Mobile devices add radios, sensors, and application platforms. Cloud systems add remote management, shared infrastructure, and service identities. A Virtual machine presents virtualized resources to a guest. Containers commonly isolate groups of processes while sharing a kernel; they are not automatically equivalent to separate virtual machines.

Neither mobility nor virtualization guarantees isolation. Hardware, operating systems, configuration, and management permissions work together. Ask where information is stored, which component interprets it, and who may change it. Operating systems explains how those questions become processes and permissions.

Terms you met

Stored programInstruction cycleMicroprocessorVirtual machine

Check yourself

No timer. No penalties. Read the explanation and try again whenever you like.

  1. Does a stored program require one unified instruction-and-data memory?

    Show the answer

    Correct answer: No; instructions can be stored separately from data. Stored-program operation and a particular memory architecture are different concepts.

  2. Does every instruction write its result to main memory?

    Show the answer

    Correct answer: No; results may affect registers, flags, control flow, or other state. Fetch-decode-execute is a useful simplification, not a promise of one memory write per instruction.

  3. What defines a microprocessor in this lesson?

    Show the answer

    Correct answer: Processor functions implemented using integrated-circuit technology. Size, integration, and fabrication distinguish the technology; low price is not a defining requirement.

  4. Does virtualization automatically prove strong isolation?

    Show the answer

    Correct answer: No; software, hardware, configuration, and management authority still matter. A virtual machine provides an abstraction with specific boundaries to implement and verify.

Try it

  • WriteDraw a fictional music player’s processor, working memory, storage, and audio device. Trace what changes when a song is loaded. Mark which information should survive a restart and where access controls matter.
References