Overview
Enter two integers and calculate their bitwise NOR - NOT(A OR B) - the counterpart to NAND, and the other logic gate considered functionally complete on its own, meaning any Boolean function can be built from NOR gates alone. As with NAND, the NOT step needs a fixed bit width to produce a bounded, non-negative result, so this calculator requires choosing 8, 16, or 32 bits before computing rather than relying on JavaScript's unbounded or 32-bit-signed bitwise defaults. Each input accepts decimal, 0b-prefixed binary, or 0x-prefixed hex, and the result is shown in decimal, binary (zero-padded to the selected width), and hex simultaneously. Both inputs are validated against the chosen width. Runs entirely client-side.
Best for: Verifying a NOR gate truth-table value or a logic-simulation result by hand
How to use this tool
- Choose a bit width. 8, 16, or 32 bits - this determines how the NOT step is bounded.
- Enter A and B. Decimal, 0b-prefixed binary, or 0x-prefixed hex, each validated against the chosen width.
- Read the NOR result. NOT(A OR B), shown in decimal, zero-padded binary, and hex all at once.
Frequently asked questions
NAND is NOT(A AND B) - it's false only when both A and B are true. NOR is NOT(A OR B) - it's true only when both A and B are false. They're related but distinct gates, and both happen to be functionally complete on their own, meaning either one alone can implement any other Boolean logic function.
The NOT step in NOR needs a fixed number of bits to flip, otherwise the result is either unbounded or, under JavaScript's native 32-bit signed bitwise semantics, a negative number that doesn't match how NOR is normally represented in digital logic. Choosing 8, 16, or 32 bits keeps the result a bounded, non-negative value at that width.
It's rejected with an error naming the valid range for that width - for example, 0-65535 at 16-bit - rather than being silently truncated or wrapped to fit.