써니 노트 써니 노트

Any boolean function can be represented using an expression contains AND and NOT operation proof : (x OR y) = NOT(NOT(x) AND NOT(y)) definition : x NAND y = NOT (x AND y) Any boolean function can be represented using an expression contains only NAND operation proof : NOT(x) = x NAND x x AND y = NOT ( x NAND y) = ( x NAND y) NAND ( x NAND y)

In a nutshell: We will start with a brief introduction of Boolean algebra, and learn how Boolean functions can be physically implemented using logic gates. We will then learn how to specify gates and chips using a Hardware Description Language (HDL), and how to simulate the behaviour of the resulting chip specifications using a hardware simulator. This background will set the stage for Project 1..

official website : https://www.nand2tetris.org/ course plan Part I: Hardware We’ll build a general-purpose computer equipped with a symbolic machine language and an assembler. To give motivation and context, we’ll start the journey by demonstrating some of the numerous video games that were already developed for this computer: Pong, Snake, Space Invaders, Life, Google’s Dyno, and more. 1. Boolea..