Symbolic vs. Connectionist — Where a 60-Year Argument Stands Today

AI has always had two tribes: one that writes the rules down, one that learns weights from examples. Tracing the Perceptrons book, the collapse of expert systems, and the backpropagation comeback explains why today's LLMs still call calculators and get shackled to grammars.

The recipe writer and the taste tester

There are roughly two ways to teach someone to cook.

One is to write the recipe down: three grams of salt, twenty minutes at 180°C, pull it out when the surface browns. Every step is explicit, so anyone following it gets the same dish — and when the dish fails you can point at the line that was wrong.

The other is to stand next to them while they cook it fifty times. You don't explain anything. They cook, you taste, you say "more salt" or "heat's too high." Eventually their hands know what to do, and neither of you can articulate why.

Those two teaching styles map exactly onto AI's two schools: symbolic AI and connectionism. Sixty years of the field is largely the story of these tribes telling each other that the other approach could never reach intelligence.

Today it looks like a rout in favor of the second. Except that the winner — the large language model — calls out to a calculator whenever it has to multiply, gets its output shackled to a JSON schema, and is paired with a symbolic deduction engine when it does mathematics. The side that won has not put down the loser's tools. This article is about why.

Symbolic AI — thinking is rearranging symbols

When the phrase "artificial intelligence" was coined at the 1956 Dartmouth workshop, the symbolic camp owned the field. Allen Newell and Herbert Simon's Logic Theorist proved theorems from Russell and Whitehead's Principia Mathematica on its own — doing what a human mathematician does, but recast as a search over symbol-rewriting rules.

In their 1976 Turing Award lecture they compressed the position into a single claim: a physical symbol system has the necessary and sufficient means for general intelligent action. In plain terms: represent the world as symbols, rearrange them by rules, search for promising arrangements. That's enough for intelligence — and anything intelligent must be doing that underneath.

The strengths of this position have not aged. If the rules are right, the answer is provably right. You can show why, as a chain of rule applications. It needs almost no data. And it composes without limit: a system that understands "Alice hit Bob" automatically handles "Bob hit Alice," because all it did was swap two symbols.

Connectionism — thinking is the strength of connections

The other camp starts from wiring rather than rules. In 1943 McCulloch and Pitts formalized a neuron as an element that fires when the weighted sum of its inputs crosses a threshold. In 1958 Frank Rosenblatt made that element learn and called it the perceptron. It was built in hardware as the Mark I Perceptron, and the press of the day described it as the embryo of a machine that would walk, talk, see and write.

The whole thing is startlingly simple.

Equation (1) says: multiply each input $x_i$ by its weight $w_i$, add them all up, add an offset $b$, and output 1 if the result is positive and 0 if it isn't. The $x_i$ are the pieces of the input (pixel brightnesses, say), the $w_i$ say how much each piece matters, and $b$ is the dial for how easily the whole thing fires at all.

The learning rule is one line too.

$$w_i \leftarrow w_i + \eta\,(t - y)\,x_i$$

Here $t$ is the correct answer, $y$ is what came out, and $\eta$ ("eta") is the step size — how far to move per correction. When the output is already right, $t - y = 0$ and nothing happens; only mistakes cause a nudge, in the direction of the mistake. That is enough: if the data can be separated by a line at all, this rule provably finds a separating line in finitely many steps.

This is the decisive break with the symbolic camp. Nobody wrote any rules. Examples went in, and a pile of numbers took over the job that rules used to do.

Then in 1969 a book came out

Marvin Minsky and Seymour Papert's Perceptrons: An Introduction to Computational Geometry (MIT Press, 1969; expanded edition 1988) answered the hype with mathematics.

Their weapon was exclusive OR (XOR) on two inputs: output 1 when exactly one input is 1, and 0 when both are 0 or both are 1.

That a single-layer perceptron can never represent this takes three lines. Substituting the four rows into equation (1) requires $b < 0$, $w_1 + b \ge 0$, $w_2 + b \ge 0$, and $w_1 + w_2 + b < 0$ to hold at once. The middle two give $w_1 \ge -b$ and $w_2 \ge -b$, so $w_1 + w_2 + b \ge -b$. But $b < 0$ makes $-b$ positive, so $w_1 + w_2 + b$ is positive — contradicting the fourth condition.