TURING COMPLETE WALKTHROUGH - CPU ARCHITECTURE (Whole Section)

[@Andoxico]

0:00 Logic Engine 8:16 Arithmetic Engine 12:56 Registers 18:39 Instruction Decoder 21:20 Calculations 27:01 Program 28:31 Conditions 35:00 Immediate Values 37:19 Turing Complete

[@TheRojo387]

I noticed you're defaulting to a big-endian format. I have various reasons for a LITTLE-endian format, including my ancestry and how left-to-right convention places the LSB at left in circuit module representations.

[@Ghost_PM11]

This is so clear and elegant, I managed to pass this level on my own, but I made a mess I barely understood at the end.

[@Andoxico]

hey if it werks it werks

[@dlopez8104]

wow your solution for conditions was wayyyy more efficient than what I was trying

[@treerexe6869]

i still dont get it tbh

[@purple-47]

I feel like conditions is the hardest level.

[@pradeisangkhro1400]

@@purple-47 agree

[@bungle6334]

I also had to redo the 'calculations' design. Previously, I didn't use any encoders, and instead I had used a bunch of gates and switches to assign bytes to registers. It worked ok, but wasn't nearly as clean/simple as using these nice little decoders. On 'program', I was very confused at what we were supposed to do with the new 'program' and counter components. That's my only mark against this game, is sometimes the directions aren't very clear with explaining what you are supposed to do. I had thought the program component was similar to the ram component... But actually it seems to act as the list of instruction bytes, which will not iterate through the bytes until you put the counter on it. Great videos!

[@ladripper47874]

My logic gate solution took up half of the entire available because I did each operation on all of the bits separately because I forgot you can make the other gates out of just nots and ors. After hearing you say it again, I came up with a solution that's similar to yours where instead of 2 ors and 2 mux, I used 1 or and 3 mux

[@skilz8098]

Nice video, was just using it as a reference to compare it to the solutions I was working on. On your Instruction Decoder section; after splitting the byte line into 8 bits, all you need to do is use a 3-8 bit decoder feeding the last 2 bits from the splitter into the first 2 input bits of the 3-8 decoder ignoring it's last input bit. You can ignore the first 6 bits coming out of the wire splitter as well. Then simply just run a wire from the first 4 output bits of the 3-8 decoder to the designated controls ignoring the last 4 output bits of the 3-8 decoder. Not that your solution is wrong, just that using premade components does make for a cleaner looking design. Or you can build a 2-4 bit decoder and save it to your component library and use that as it would have less internal components. "Layers of Abstraction!"

[@Andoxico]

I guess I'm a stickler for optimization. A 3 bit decoder uses a lot of gates which is kinda wasteful when all that's required is a few nots and ands. It's been a while since I've played but if I remember correctly at some point the game will start calculating your gate delay and such.

[@skilz8098]

@@Andoxico True, but that's why I did say "Or build a 2-4 bit decoder" using that in place of the 3-8 bit decoder. This would be most optimal and practical for this particular application.Make a folder Decoders. Then have independent schematics for each decoder: 1-2, 2-4, 3-8, 4-16, 5-32, 6-64, 7-128, and 8-256. Then you'll have the exact decoder you need for each particular application.

[@Andoxico]

@@skilz8098 a 2-bit decoder is exactly what I built

[@skilz8098]

@@Andoxico Yeah, but I was thinking on the line of a module that you can reuse. :)

[@skilz8098]

@@Andoxico Okay, the game does have limitations. It won't let you build sub components that can be reusable at this stage of the game... what a shame.

[@JamesKorcc]

I actually completed the conditions level a completely different way and the final level just wouldn't work, I must have had some fringe edge case where the output was wrong but all of the tests passed. It was driving me insane so I just used your solution and it worked.. lol

[@coolbugfacts1234]

I wish it would have specified in Conditions that you only need to worry about signed ints, I got hung up overanalyzing the case for unsigned when the high bit is set. Also, you can check if the input is zero with only three components - negate, add, and 1 bit not. I'm not sure if that's overly clever but you get an achievement in the game for solving Conditions with 10 or fewer components.

[@xlorrix-6320]

for the logic engine i used for mux-s and a decoder and just made each part individually

[@Pos44Dami]

did you have share your idea ?? anywhere

[@r_firefly4292]

Really appreciate your indepth explanation!

[@Andoxico]

Glad you found it helpful

[@ProHolmes]

I solved the last task slightly different. Same as you I plugged the main but into override value input of the counter. But then I just used AND to make sure that both condition modde is on and condition is met and plugged AND output to the counter increment/override input.

[@alant779]

Comparing to your conditions solution, I can see that I'm overly dependent on NOT and AND gates. I've used more switches compared to before after you pointed out they're basically AND gates. I'll probably be using XOR gates more now that I can see them as togglable NOT gates. If I come out of this game learning nothing but these two tips, it would've been worth it. Thanks!

[@jimlthor]

I think I rely on XOR more than anything else now. I've been checking solutions after solving them and realizing I'm using twice as many parts as needed. Been trying it other ways as well, but making sure I understand why it works before carrying on

[@Pos44Dami]

very clean

[@klappadu7020]

I found the logic engine a bit conter intuitive becaues the game let you build every entire logical function based on the NAND gate previously and suddenly expects you to do this with OR and NOT

[@JeffHPhoto]

Hey, awesome and well-made tutorial! I have one question, though: between the Calculations level and the Program level, I noticed a cut in which you wired the ALU to the DEC component, and did not explain why. I was just wondering if you had a reason, thanks! EDIT: I realize now it was right under my nose! You literally just connected the bus for the program output in a different way, my bad

[@Andoxico]

oh yea the wiring looks a bit silly lol

[@sameliusastraton4670]

I accidently deleted my ALU, so i wired it up like yours, and i got an error REG 0 should have value 123, im a blind jellyfish, LOL. Its still a bunch of wires to me, i understand binary code and the logic gates, I think i have to start from the beginning again, its still a bit Jargony talk for me, thanks for trying to explain, but not all of us went to high school, or college. Thanks.

[@domeldridge2994]

Thank you so much

[@selebi-gadget-lab]

You use tutorial. Why?

[@Andoxico]

What tutorial?

[@selebi-gadget-lab]

@@Andoxico 1:26

[@Andoxico]

@@selebi-gadget-lab I was just using that as a visual aid to show how an AND gate is actually an inverted NAND gate rather than the opposite

[@jimlthor]

Just showing how the very basic NAND gate works as an example. Glad he did that because I was trying to do this the LOOONNNGGG way

[@mpgoficial]

how to download turing complete for free on pc?

[@selebi-gadget-lab]

Have you already downloaded it for free?

[@mpgoficial]

@@selebi-gadget-lab YES

[@selebi-gadget-lab]

@@mpgoficial You are a pirate! =)

[@nedwizard]

torrent trackers

[@onepunch1908]

I think your solution in conditions was a bit difficult, i use a 3-bit decoder and i think it is mach easier to understand

[@Andoxico]

that's valid, but later on when you unlock the stats for each level like the gate delay the 3-bit decoder will be slower :p

[@onepunch1908]

@@Andoxico oh, I'm gonna to rebuild all... :(

[@Andoxico]

@@onepunch1908 don't feel bad, the important thing is you thought it through and made your own solution

[@onepunch1908]

@@Andoxico hah, thank you, of course in this area it is necessary to ponder, reflect and not just copy someone's template... and his decision will come in any case. I don't have any problems with arithmetic and ALU logic in this game, but I can't fully understand how memory works

[@Andoxico]

@@onepunch1908 If you go back to Saving Gracefully you can kinda study how memory works. When the SAVE/DON'T SAVE input is turned on (SAVE), whatever the state of the other input is will be saved in the circuit and output the next tick. That value will stay in the circuit even after the SAVE input is turned off and will stay in the circuit until SAVE is turned back on and overwrites whatever was in the circuit. Put 8 of these together and use a switch on the output side to toggle LOAD/DON'T LOAD and then you have an 8-bit register.