w:c:strategywiki>Henke37 (Yet another basic gate) |
(Added infobox) |
||
| (6 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. | ||
{| {{ | {| {{TruthTable}} | ||
|+ NOR Gate Truth Table | |+ NOR Gate Truth Table | ||
|- | |- | ||
! Input | ! Input 1 !! Input 2 !! Output | ||
|- | |- | ||
| | | {{Off t}}|| {{Off t}}|| {{On t}} | ||
|- | |- | ||
| | | {{Off t}}|| {{On t}}|| {{Off t}} | ||
|- | |- | ||
| | | {{On t}}|| {{Off t}}|| {{Off t}} | ||
|- | |- | ||
| | | {{On t}}|| {{On t}}|| {{Off t}} | ||
|} | |} | ||
To solve this level, place one NAND gate and put NOT gates on both of the inputs. | 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. | ||
{{Footer Nav|game=Turing Complete|prevpage=NOT Gate|nextpage=OR Gate}} | {{Footer Nav|game=Turing Complete|prevpage=NOT Gate|nextpage=OR Gate}} | ||
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.
| 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.