خيط · 7 خطوة · 5,336 سنة
From clay tally-tokens to Turing's imaginary machine — how counting sheep became the theory of everything a computer could ever do, in 7 steps.
محتوى الخيوط بالإنجليزية حتى الآن — والترجمات المتحقَّق منها على خارطة الطريق.
مرّر للنزول ↓
~3,400 BC (token accounting)
The Sumerians and Babylonians did arithmetic in base 60, and you still use it every single day: 60 seconds in a minute, 60 minutes in an hour, 360 degrees in a circle — a 4,000-year-old choice of number base, still running the world's clocks.
Ways of counting, calculating, and measuring shapes — the mental tools that turn "some sheep" into "seventeen sheep" and "that field" into "so many paces on each side."
It begins with tally marks — counting sheep into clay, the first time a quantity is captured outside a human head.
تعمّق أكثر →جعل تصوُّره ممكنًا ↓ Writing
1 / 7 · 3,400 BC
~3,200 BC
One of the oldest personal names we can read belongs not to a king or a god but to an accountant: "Kushim," whose mark appears on Sumerian barley records around 3,200 BC — though scholars debate whether Kushim was a person, an office, or an institution. Writing was invented for bookkeeping; poetry, prayer, and history came afterward.
Marks that store speech and records outside a human head — memory that survives its owner and travels without a messenger.
Symbols that store more than counts: reasoning itself can now be written down, carried, and checked by someone who wasn't there.
تعمّق أكثر →جعل تصوُّره ممكنًا ↓ Deductive geometry
2 / 7 · 3,200 BC
~300 BC (Euclid's Elements)
Abraham Lincoln, at forty and already a congressman, carried a copy of Euclid's Elements in his saddlebag on the legal circuit and would not stop until he could prove every theorem in the first six books from memory. He did it to understand a single word he kept meeting in law — "demonstrate" — and the habit surfaces in the Gettysburg Address: a nation "dedicated to the proposition."
Truths about space derived from a handful of stated assumptions by pure logic — each new result proved from earlier ones in an unbroken chain, so that once you accept the starting points you must accept everything that follows.
Euclid chains truths from bare assumptions by pure logic — the first machine for manufacturing certainty, run on paper.
تعمّق أكثر →جعل تصوُّره ممكنًا ↓ Algebra
3 / 7 · 300 BC
~820 AD (al-Khwarizmi's al-Jabr)
In medieval Spain an "algebrista" was not a mathematician but a bone-setter. Al-Khwarizmi's word al-jabr means the restoration or reuniting of broken parts; barbers who reset dislocated bones borrowed the same term, and it appears in Don Quixote for exactly that trade — the man who puts a snapped leg back together and the operation that puts a subtracted term back on the other side of an equation share one name.
A systematic method for finding an unknown quantity by writing down what is known about it and transforming the statement — moving terms across the balance, cancelling like against like — until the unknown stands alone. It turns "what number, tripled and increased by four, gives nineteen?" into a procedure anyone can run.
Al-Khwarizmi makes it mechanical: a fixed procedure for shuffling unknown symbols, and thinking starts to look like a set of rules.
تعمّق أكثر →جعل تصوُّره ممكنًا ↓ Boolean logic
4 / 7 · 820 AD
1847 AD
George Boole's algebra of true and false sat as a mathematical curiosity for about ninety years. Then in 1937 a twenty-one-year-old MIT master's student, Claude Shannon, submitted a thesis showing that Boole's two values map exactly onto electrical switches that are open or closed, and every logical operation onto a wiring pattern of relays. That single thesis — often called the most important master's thesis of the century — is the reason every computer on Earth is built out of AND, OR and NOT gates.
An algebra in which the only values are true and false — 1 and 0 — and the only operations are AND, OR and NOT. It turns reasoning into calculation: logical statements can be combined and simplified by fixed rules, the way ordinary algebra combines numbers.
Boole strips reasoning down to two values — true and false, 1 and 0 — combined by AND, OR, NOT, so logic becomes a kind of arithmetic.
تعمّق أكثر →جعل تصوُّره ممكنًا ↓ Mathematical logic
5 / 7 · 1847 AD
1879 (Frege's Begriffsschrift)
Frege's 1879 Begriffsschrift invented essentially all of modern logic — variables, quantifiers ("for all," "there exists"), and formal proof — yet its strange two-dimensional notation was so alien that the book barely sold and reviewers mocked or ignored it. Worse: as Frege's grand system was going to press two decades later, a 1902 letter from Bertrand Russell showed that a single contradiction, Russell's paradox, collapsed its foundation. Frege, by his own account, was "thunderstruck."
Reasoning itself turned into a formal system — a precise symbolic language with explicit rules of inference, in which a proof becomes an object you can check mechanically, symbol by symbol, without understanding what it means.
Frege turns proof itself into a formal language: a proof becomes an object you can check symbol by symbol, without knowing what it means.
تعمّق أكثر →جعل تصوُّره ممكنًا ↓ Theory of computation
6 / 7 · 1879 AD
1936 (Turing and Church)
Turing dreamed up an imaginary machine purely to prove a limit, not to build a computer. He showed that no program can exist that decides, for every possible program, whether it will eventually halt or run forever — the halting problem. The proof is a trap: if such a halt-checker existed, you could build a program that asks the checker about itself and then does the opposite, a contradiction. The "universal machine" he sketched to run the argument turned out to be the blueprint of every computer since.
The mathematics of what can be computed at all, by any mechanical procedure whatever. Alan Turing and Alonzo Church, independently in 1936, made the notion of "algorithm" exact — and used it to prove that some perfectly well-posed questions have no algorithm that can answer them.
Turing sketches an imaginary machine to run that checking — and proves some questions no machine can ever answer; the universal machine he drew for the argument is the blueprint of every computer since.
تعمّق أكثر →7 / 7 · 1936 AD
7 قدرة، كل واحدة مستحيلة من دون التي قبلها.