Oh no!

Template knot disallowed for unauthenticated users.

baumhaus.digital/Studium Generale/Short History of the Learning Machine/Logic, Gates, Machine/Three Languages, One Algorithm
Logic (Boole 1854)Wire (Shannon 1937)Machine (Turing 1936)
what it isformulascircuit of gatestape, head, states
sum digitout = b XOR cXOR gatewrite rule
carryc′ = b AND cAND gate + wirenext state (thumb)
many bitssame formula for each ia chain: spaceone gate pair, repeated: time

Same algorithm, three notations. Algebra says what, gates say with what, the machine says in what order.

And the translation between them is mechanical — which is exactly why computers can exist.

0 Axones