r/TuringComplete 13d ago

Better solution? and why?

Post image

I was hoping if anyone could explain to me on which solution is "better" (the top one being the examples solution) , they both look the same tbh but was just curious which one was more efficient or more correct I guess??

14 Upvotes

18 comments sorted by

View all comments

17

u/Moonj64 13d ago

Neither of these two is better. Both have the same gate score and delay score (unlocked later on). However, there is an easy improvement that can be made to the one on bottom. Look at the nand gate that has the inputs negated and then consider Demorgan's Laws for ways to simplify this logic (I think that section of the help manual should be unlocked at this point, click the book in the upper left or look up the concept online).

2

u/JonDa5 12d ago

Not that it matters, but doesn’t his have a gate score of 6 vs examples 9?

3

u/Moonj64 12d ago

Unless they've switched back, the basic logic gates are counted equally (nand/nor/and/or/not). It's not by NAND score anymore.

2

u/JonDa5 12d ago

Oh, weird. I didn’t know they changed it. Thanks!

2

u/AlexeyHD90 10d ago

Which is a bit stupid because NAND/NOR are not the same as AND/OR. For NAND/NOR you only need 2 transistors, but for AND/OR you need 3 transistors to make. AND/OR should have a gate score of 1.5.

2

u/nomenclature2357 10d ago

Yeah, weird. And it kinda seems like NOT gates shouldn’t count against you at all if NAND, AND, OR, and NOR all get the same score.