📜 ⬆️ ⬇️

Computer of 10,000 Domino Bones

Matt Parker, noted in the projects Numberphile and Standup Maths , in a company with the Domino Computer Builders team, built probably the slowest computer in the world of domino bones.


Some details under the cut.

First of all, we need basic elements. This is what AND gate looks like:

If you push one of the inputs (“send a unit”), we get “zero” at the output: “unit” on the right input simply “closes the key”, the unit on the left is doubled, and the signal that went to the right closes the key for the left one than he gets to him. If you push both inputs, the right signal, by closing the key, will not allow the left input to “self-destruct”, and the “one” will be output.

And this is the XOR gate.

Here, if you send "units" to both inputs, the dominoes will stop in the middle, and the output will be "zero".
')
A half-adder is made up of these two elements, which takes two bits at the input and outputs their sum at two outputs: the output of “units” is XOR, the output of “twos” is AND.

The zigzag on the right is a signal delay to enable the key to be closed before exiting the two, if necessary.
Left exit - x XOR y - units, right - (NOT (x XOR y)) AND y = x AND y - twos.

Of the two half-adders, a full-value adder is obtained, which, in addition to the input bits, also takes the carry bit. By connecting three such adders (and a half-adder for initial bits, where no carry is required), the team received a calculator that can add two four-bit numbers and produce a five-bit response.

The main problem of such circuits is signal leakage. Incorrectly dropped or flown away dominoes can trigger another chain, “breaking” the withdrawal in this way.

Source: https://habr.com/ru/post/221639/


All Articles