Hello, today i made a redstone computer. It has 16 different combinations.

I only used 4 transistors, this is because if i wanted to have more transistors, that would mean more combinations. 2^(amount of transistors) = Amount of combinations. If i had 5 transistors, that would be 32 combinations. Witch is something i don't want to bother with. These transistors count in binary.

Here are the two inputs. Adding and subtracting.

The addition is fairly simple. It just gives a single output. But the subtracting is trickier. Basically i have to give it (The amount of combinations) - 1 outputs. Looping it backwards. This is called "Overflow". so 3 + (16 - 1) makes it loop around back to 3, but it doesn't make a complete loop, therefor it ends up to 2.

Now, all the combinations have outputs, witch can be attached to anything. Farm, screen, pistons, you get it. All the outputs are made from logic gates. And, nand, or, nor. These 4 logic gates make up all the outputs for the combinations.