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

Turing Complete: All Levels Solution

Turing Complete is a new puzzle game released via Steam. here is the solution for all levels.   Turing Complete All Puzzles Solution NOT GATE NOR GATE OR GATE AND GATE ALWAYS ON SECOND TICK XOR GATE Thanks to aabbiknru for his great guide, all credit to his effort. you can also read the original … Read more