Dont know why it didnt keep the text. But this a 4 bit ALU i think. It has 2 functions 4 bit Adder and Bitwise XOR (I Think thats what its called.).
I mainly built this as a proof of concept for my self, and is by no means an efficient machine.
1. It’s not Turing Complete because no conditionals / jumps, could easily be added with XOR function (XOR logic has an output for both A and B are the same.)
2. No memory / Ram and literally only has 12 bits of storage technically.
3. No real I/O interface.
also don’t slander me because i have no idea what i’m talking about half the time this is just like 30 mins of watching Ben Eater on YT.
1 Comment
Dont know why it didnt keep the text. But this a 4 bit ALU i think. It has 2 functions 4 bit Adder and Bitwise XOR (I Think thats what its called.).
I mainly built this as a proof of concept for my self, and is by no means an efficient machine.
1. It’s not Turing Complete because no conditionals / jumps, could easily be added with XOR function (XOR logic has an output for both A and B are the same.)
2. No memory / Ram and literally only has 12 bits of storage technically.
3. No real I/O interface.
also don’t slander me because i have no idea what i’m talking about half the time this is just like 30 mins of watching Ben Eater on YT.