electrons n sheeeeit
Black magic
captcha goes in.
shitpost comes out.
they don't
>>61574890
Lol
a million billion logic gates
>>61574854
By installing gentoo
>>61574854
ramz
MOAR RAMZ
>>61574953
haha BILLion GATES
:)
>>61575026
>pedoGATES
>>61574964
arch
transistors EVERYWHERE
Look into how transistors work. Transistors can either be on or off depending on whether a current is running through the base of the transistor. Because of this you can use them to create basic logic. Basic logic can be chained together to create more complicated logic. Which can be strung together to create even more complexity. No matter how much complexity goes into them however computers at their most primitive level are just AND, NOT and OR gates with current being routed through them. For instance if I want to add two numbers I'd just make a basic circuit for adding two pieces of logic together (bits) and carrying the remainder.
We can even set up a truth table for this and try to figure out what logic might prove useful for such a task.A B A+B C
0 0 0 0
1 0 1 0
0 1 1 0
1 1 1 1
In this case we might immediately notice that A+B column is simply AorB and the C column is simply AandB
As such a primitive gate for adding two single bit numbers is simply two current, A and B being routed into both an OR gate and an AND gate.
If we were to attack two LEDs to the results of these gates and run a current into A and B both then both LEDs would light up. If we attached it to only A then only the right led would light up and likewise with B. If we ran no current through either A or B's base neither LED would light.
>>61575116
I misspoke, it should be A+B is true if A xor B is true. I accidentally put a 1 in my bottom row for A+B and fucked my logic
>>61575116
Now if we think about it adding more bits isn't all that complicated. Just remember your elementary school arithmetic. 12+9 is simply 9+2 = 1 carry a 10 and so we get 1+1=2 in the 10s column. Put it all together and we get 21.
Logic gates aren't much different. For the columns greater than 2^0 we need to check if anything was carried forward from the previous column as such our logic actually consists of adding A+B+C but you remember the associative property of addition A+B+C is simply (A+B)+C.A B C A+B A+B+C D
0 0 0 0 0 0
0 0 1 0 1 0
0 1 0 1 1 0
1 0 0 1 1 0
0 1 1 1 0 1
1 0 1 1 0 1
1 1 0 0 0 1
1 1 1 0 1 1
A+B+C is true if (A xor B) xor C is true and D is true if [(A xor B) and C] or (A and B) are true.
This is called a full adder and is how your computer does arithmetic on positive integers.
electronic circuits which produce an output for a given input.
>>61575680
Negative integers and subtraction are special case. They use a system called twos compliment where the additive inverse of a positive integer is simply the bits of that number reversed and add one. It is for this reason that full adders make up the entirety of most arithmetic logic units because you can accomplish the adding of one for twos compliment by simply setting the carry to on.
If we set up a truth table for inversing a bit we see how simple this is to create. Letting A be our bit in question and S be our subtraction flag.A S R
0 1 1
1 0 1
This is simply an xor gate and again the adding of one is accomplished by setting the carry to on if subtraction is true.
If you wanted to add 2 4-bit numbers you'd simply route each bit of said number into the respective adder of 4 full adders. If you wanted to subtract a 4-bit number from another you'd set the S on your xor gates to true and connect your carry of your 2^0 full adder to on.
THEY WORK WITH WAVE MANIPULATION AND LAYERS OF ABSTRACTION
ANY OTHER ANSWER IS AUTISM OR A LIE
>>61575116
>>61575680
>>61575896
cool story fag, get a blog