607
edits
mNo edit summary |
|||
| Line 16: | Line 16: | ||
* Logic gates | * Logic gates | ||
* Encoding | * Encoding | ||
* Memory | * Memory | ||
== Logic Gates | == Logic Gates == | ||
The core of the machine, AND OR and XOR gates should allow the creation of an adder. | === Adder === | ||
The initial core of the machine, AND OR and XOR gates should allow the creation of an adder. | |||
Broadly speaking there are two approaches (that I've thought of so far), fluid/statistical: | Broadly speaking there are two approaches (that I've thought of so far), fluid/statistical: | ||
| Line 34: | Line 34: | ||
Current favourite is the different sized ball bearings. A small difference in diameter results in a large change in mass. Flux has ordered 100x4mm (0.2610g) and 100x5mm (0.5099g) high grade steel ball bearings for experimentation. | Current favourite is the different sized ball bearings. A small difference in diameter results in a large change in mass. Flux has ordered 100x4mm (0.2610g) and 100x5mm (0.5099g) high grade steel ball bearings for experimentation. | ||
== Boolean Logic == | === Boolean Logic === | ||
If we use different weights of balls for 1 and 0 then a simple balance test could compare numbers. If the high order bit of each number was farthest from the fulcrum then if the lever balances then the values are equal, otherwise is leans to the sizes which is larger. This does mean that the bit order in a nibble needs to be reversed for one of the numbers. | If we use different weights of balls for 1 and 0 then a simple balance test could compare numbers. If the high order bit of each number was farthest from the fulcrum then if the lever balances then the values are equal, otherwise is leans to the sizes which is larger. This does mean that the bit order in a nibble needs to be reversed for one of the numbers. | ||