A logical NAND, also known as a Sheffer Stroke, is a logical operation in electronic computing and processor computing as a similar operation to the AND operation. A logical NAND is simply-put, a Not AND. For the logical AND, if both bits in the compared position are 1, the bit in the resulting binary representation is 1 (1 × 1 = 1); otherwise, the result is 0 (1 × 0 = 0 and 0 × 0 = 0). This differs in the logical NAND where if both bits are 1 or a combination of 0 and 1, then the resulting bit is 1. If both bits are 1, then the resulting bit is 0.
A truth table provides infomation for logical operations of different functions to what a result shall be, following an operation of input.
Here is a truth table:
And the truth table, as well as what I had wrote above explains what the NAND operation does (in layman's terms).
A truth table provides infomation for logical operations of different functions to what a result shall be, following an operation of input.
Here is a truth table:
And the truth table, as well as what I had wrote above explains what the NAND operation does (in layman's terms).
Discord: SnB_BWH
