4 ms·
I believe a NAND gate is required as the base on which all other possible circuits can be built, so they need just to add an inverter for potential turing compl
by beachy 2y ago
I believe a NAND gate is required as the base on which all other possible circuits can be built, so they need just to add an inverter for potential turing completeness.
- thih9 2y agoCould be either {NAND}, or {NOR}. https://en.m.wikipedia.org/wiki/Functional_completeness https://en.m.wikipedia.org/wiki/Functional_completeness https://proofwiki.org/wiki/Functionally_Complete_Singleton_Sets https://proofwiki.org/wiki/Functionally_Complete_Singleton_S...
- mtizim 2y agoIt's not, we just use NAND everywhere because they're easier to make with transistors. You can get functional completeness with a NOR instead, or alternatively with some different combinations of other logical operators. https://en.m.wikipedia.org/wiki/Functional_completeness https://en.m.wikipedia.org/wiki/Functional_completeness We even implement AND gates with NANDs in electronics (because they're way simpler), but we might not have to limit ourselves to a single base gate with mechanical computers.
- DrDeadCrash 2y agoI believe an inverter (not gate) is required...
- deleted 2y ago[deleted]
- Feathercrown 2y agoYou can route a wire to both inputs of a NAND or NOR gate to create a NOT.
- SanderNL 2y agoWhere do you think the N in NOR and NAND come from?
- mrln 2y ago> Where do you think the N in NOR and NAND come from? That makes it sound like you could also do a NOT with XNOR, which is only the case if you can use a constant 0. But that would similarly also be the case for a XOR, but with the requirement of a 1.
- SanderNL 2y agoThat’s cool, but I meant to imply it is kind of backwards to make a NOT gate with a component that itself is fundamentally built out of a NOT gate.