How this calculator works
NOR is true only when neither input bit is set. Every inversion is limited to the selected width so the output has a definite finite representation. Inputs must fit the selected width. Short binary patterns receive leading zeros. Decimal negatives use two's complement and must be at least -2^(n-1). The signed output interprets the top bit as a negative place value; the unsigned output reads the same pattern as nonnegative.
Formula
For width n, NOR(a, b) = (2^n - 1) XOR (a OR b). Each result bit is 1 only for inputs (0, 0).
Worked example
In four bits, 1100 NOR 1010 = 0001. In eight bits the same values give 11110001.
Advertisement
Frequently asked questions
How is NOR different from ordinary arithmetic?
It acts separately on each bit position without carrying between columns. The table shows the input pair and output bit for every position.
What happens at the limits?
Two zero inputs produce all ones, which reads as -1 in two's complement at any supported width.
Can I use more than 32 bits?
Yes. Choose a preset through 64 bits or a custom width from 1 to 256. Text entry preserves every digit, including leading zeros.
Why can signed and unsigned results differ?
They interpret one stored pattern differently. If its highest bit is 1, two's complement subtracts 2^n from the unsigned value.