Level/NOR Gate: Difference between revisions

From Turing Complete
w:c:strategywiki>Henke37
(Mixed up the solution with the OR gate)
(Added infobox)
 
(5 intermediate revisions by 2 users not shown)
Line 1: Line 1:
{{Header Nav|game=Turing Complete}}
{{Header Nav|game=Turing Complete}}
{{Infobox level
| section            = Basic Logic
| type                = Component
| prerequisite1      = NOT Gate
| unlocks-level1      = Always On
| unlocks-component1  = NOT
| api-enum-id        = nor_gate
| api-enum-number    = 21
}}


This level has you create the NOR Gate.
This level has you create the NOR Gate.


{| {{Prettytable}}
{| {{TruthTable}}
|+ NOR Gate Truth Table
|+ NOR Gate Truth Table
|-
|-
! Input One !! Input Two !! Output
! Input 1 !! Input 2 !! Output
|-
|-
| False|| False|| True
| {{Off t}}|| {{Off t}}|| {{On t}}
|-
|-
| False|| True|| False
| {{Off t}}|| {{On t}}|| {{Off t}}
|-
|-
| True|| False|| False
| {{On t}}|| {{Off t}}|| {{Off t}}
|-
|-
| True|| True|| False
| {{On t}}|| {{On t}}|| {{Off t}}
|}
|}



Latest revision as of 23:53, 1 September 2024

Section Basic Logic
Type Component
Prerequisite NOT Gate
Unlocks Always On
NOT
Scored No
API nor_gate (21)

This level has you create the NOR Gate.

NOR Gate Truth Table
Input 1 Input 2 Output
0 0 1
0 1 0
1 0 0
1 1 0

To solve this level, place one NAND gate and put NOT gates on both of the inputs as well as a NOT gate on the output.