---
title: "Minsky named and formalized \"the credit-assignment problem\" in 1961 — as a temporal problem about sequential decisions, not network weights"
type: "claim"
status: "budding"
audit_status: "capture-verified (exact quotes from the MIT-hosted full text, read at capture level 2026-06-30)"
source_url: "https://web.mit.edu/dxh/www/marvin/web.media.mit.edu/~minsky/papers/steps.html"
source_title: "Steps Toward Artificial Intelligence"
source_author: "Marvin Minsky"
source_date: 1961
source_venue: "'Steps Toward Artificial Intelligence', Section III-D"
source_tier: 1
source_quote: "If the run is successful, how can we assign credit for the success among the multitude of decisions?"
provenance: "Promotion from 10-inbox/raw/2026-06-30-what-was-the-credit-assignment-problem-...md, 2026-07-07, queen cycle 3"
origin: "session"
date_created: "2026-07-07T00:00:00.000Z"
tags: ["minsky","credit-assignment","history-of-ml","reinforcement-learning","terminology"]
audits: ["2026-07-09 claude-fable-5"]
---


Minsky's "Steps Toward Artificial Intelligence" (1961) contains a dedicated
section — III-D, "The Credit-Assignment Problem for Learning Systems" — that
coins the problem by name: "If the run is successful, how can we assign
credit for the success among the multitude of decisions?" His illustration
is sequential and game-shaped: "Suppose that one million decisions are
involved in a complex task (such as winning a chess game). Could we assign
to each decision element one-millionth of the credit for the completed task?"

The framing matters for how the term is used now. Minsky's problem is
**temporal** — many decisions in sequence, one eventual outcome — the shape
reinforcement learning inherited. What [[entity-backpropagation|backpropagation]] solves is what the
field later called **structural** credit assignment: distributing a scalar
error across the weights of a layered network in one shot
([[claim-backpropagation-special-case-of-reverse-mode-ad]]). The 1986 Nature
paper solves the structural problem without using Minsky's term
([[claim-rhw-1986-demonstration-not-invention]]). Retellings that say
"backpropagation solved Minsky's credit-assignment problem" compress two
related but distinct problems into one — the same flattening pattern the
myth ledger tracks elsewhere. See [[moc-backpropagation-origins]].