🏢 컴퓨터구조/NAND to Tetris
unit1.2 Boolean function
써니(>_<)
2022. 7. 19. 07:47
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)