Turing Complete: De Morgan’s Law or How to NAND
A small guide on De Morgan’s Law. It will allow you to replace NAND gates with AND, OR and NOT gates – or to replace these with NAND gates. You might even be able to somewhat reduce your gate count. Notation Following, I will use these symbols: ∧ – AND ∨ – OR ¬ … Read more