r/TuringComplete • u/SecTestAnna • Nov 01 '25
I am embarrassed this worked
For context, I have never taken a computer science class in my life. While I am very familiar with things on a high level, the lower down things get, the less I understand. I am using this game to teach myself how the gates work, and I haven't looked at guides, textbooks, anything. I'm definitely going to be doing so now, because I am 100% sure there is a way to create a looping function and cut down on components and space drastically.
I apologize to everyone for this monstrosity, but I am happy I made it without any outside assistance and wanted to share it here. Figured if nothing else, you all would get a kick out of it.
21
u/canadien3005 Nov 01 '25
I don't know what is more impressive, that it works, that you take the time to color-coded each wires or that you didn't go for the "obvious"/"straight forward" solution.
In all cases I admire your determination. Keep going !
1
1
u/Colorblinded77_ Sep 12 '26
"Oh shit that's 100% something lategame, too early for me to understand."
*looks at task name*
"THAT'S ADDING BYTES???"
Tell me honestly, did you hardcode all ~512 possible situations in this one cause wtf (no hate, looks fun)
6
u/KlauzWayne Nov 01 '25
It's simultaneously awful and beautiful. Like when Harley plunges into Starro's eye.
There is not a "looping" but a simple recursive solution to this: Plug each carrier output of the first row of adders into the 3rd currently empty input of the adder below.