NOR Calculator — Bitwise NOR Operation
Compute A NOR B in one step: enter two integers and see the bitwise NOR result with its binary and hex representations, plus a step-by-step breakdown of OR followed by NOT.
Bitwise NOR = NOT(A OR B) — output bits are 1 only where both inputs are 0
Step 1 — bitwise OR
Step 2 — bitwise NOT (complement)
- 1
Bitwise OR (A | B)
12 OR 10 = 14 - 2
Bitwise NOT (~)
NOT (14) = -15NOR = NOT(A OR B); output bit is 1 only where both input bits are 0.
Wie funktioniert dieser Rechner?
Bitwise NOR = NOT(A OR B). Each output bit is 1 only where both input bits are 0; all other positions are 0. For example 12 (00001100) NOR 10 (00001010) = NOT(00001110) = 11110001 = −15 in 8-bit two's complement. NOR is a universal gate: any logic function can be built from NOR gates alone.
Formel
How this is calculated
Bitwise NOR is a two-step operation: first compute the bitwise OR of the two operands (each output bit is 1 if either input bit is 1), then invert every bit (bitwise NOT, also written ~). The result is therefore 1 in a bit position only when both A and B have a 0 in that position.
For example, A = 12 (binary 00001100) and B = 10 (binary 00001010): OR gives 00001110, and NOT of that in 8-bit two's complement gives 11110001, which is −15 in signed representation. For non-negative inputs the NOR result is always negative (the most significant bit is set by the NOT), making it important to interpret the result using two's complement.
NOR is one of the two universal logic gates (the other being NAND): any Boolean function — AND, OR, NOT, XOR, and so on — can be built entirely from NOR gates. This universality makes NOR fundamental in digital circuit design. In programming, bitwise NOR is commonly expressed as ~(A | B) and appears in tasks such as clearing flag bits that are set in either of two masks.
Häufige Fragen
NOR is "NOT OR". Its output is 1 (true) only when both inputs are 0 (false). As soon as either input is 1, the OR is 1 and the NOT inverts it to 0. NOR is one of two universal logic gates — any Boolean circuit can be built from NOR gates alone.
Because bitwise NOT (~) flips all bits including the sign bit. In two's complement representation (used by virtually all hardware and languages), flipping the sign bit of a positive number makes it negative. For an n-bit word: ~x = -(x + 1). So ~0 = -1, ~14 = -15, and so on.
OR: output is 1 when at least one input bit is 1. AND: output is 1 only when both bits are 1. NOR: output is 1 only when both bits are 0 (the complement of OR). NAND (complement of AND): output is 0 only when both bits are 1. NOR and NAND are the "inverted" versions of OR and AND respectively.
Auch bekannt als
TG we-Calculate Editorial Team. (2026). NOR Calculator — Bitwise NOR Operation [Online calculator]. TG we-Calculate. https://we-calculate.com/de/calculator/nor-calculator
TG we-Calculate Editorial Team. "NOR Calculator — Bitwise NOR Operation." TG we-Calculate. 2026. https://we-calculate.com/de/calculator/nor-calculator.
TG we-Calculate Editorial Team, "NOR Calculator — Bitwise NOR Operation," TG we-Calculate, 2026. [Online]. Available: https://we-calculate.com/de/calculator/nor-calculator
@misc{wecalculate_nor_calculator, title = {NOR Calculator — Bitwise NOR Operation}, author = {{TG we-Calculate Editorial Team}}, howpublished = {\url{https://we-calculate.com/de/calculator/nor-calculator}}, year = {2026}, note = {TG we-Calculate} }
Hat Ihnen dieser Rechner geholfen?