STRATA
Skip to study
XLVII

IV.03 / AI

Dartmouth and the formation of AI

What did the Dartmouth proposal ask its participants to accomplish over one summer?

A source-led introduction1 source references1 related experiments

Start with the question.

The Dartmouth proposal, dated 1955 for the following summer's project, documents an agenda assembled by McCarthy, Minsky, Rochester, and Shannon. It is especially useful as a primary record of what the authors thought could be studied together. The historical question is how those ambitions were translated into particular research programs, institutions, demonstrations, and measures of progress.

Turn an agenda item into a research lineage.

Choose one problem named in the proposal and locate a later paper that explicitly addresses it. Record the original wording, the later operational task, and the method introduced between them. An apparent continuation should be supported by citations or documented influence rather than by a shared modern label alone.

What would you inspect?

  • The proposal's stated aims, dates, participants, and expected methods.
  • Changes in the meaning of a research problem across later publications.

Take the next step.

Create a three-document timeline connecting the proposal to one demonstrable technical development, with a citation explaining each link.

Put part of the question to work.

These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.

Try connectivity and removal.

Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.

Open its full page

Watch the quantities change.

12 seconds · Original model visualization · Silent

Connectivity and removal

Compare local connections with the paths that hold a network together.

Read the explanation and method

Forty-eight points are drawn from one fixed random seed. A link joins two points whenever their distance is within the displayed radius.

The radius grows from 0.05 to 0.4 of the unit square. Existing links remain while new links merge previously separate connected groups.

Orange marks the largest connected group. Connectivity here describes paths through this constructed graph; it does not measure information quality, influence, or causality.

Method. Two nodes share an undirected edge when their Euclidean distance is at most the connection radius. After removal, a depth-first traversal assigns every active node to a connected component. Groups are ranked by size; ties use their lowest node identifier.

Read the supporting material.

  1. A Proposal for the Dartmouth Summer Research Project on Artificial Intelligence

    John McCarthy, Marvin Minsky, Nathaniel Rochester, and Claude Shannon · The 1955 proposal, its authors, and stated research agenda for summer 1956.