m (Smaller truth table) |
(Added infobox) |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Header Nav|game=Turing Complete}} | {{Header Nav|game=Turing Complete}} | ||
{{Infobox level | |||
| section = Basic Logic | |||
| type = Component | |||
| prerequisite1 = Crude Awakening | |||
| unlocks-level1 = AND Gate | |||
| unlocks-level2 = NOR Gate | |||
| unlocks-level3 = OR Gate | |||
| unlocks-component1 = NOT | |||
| unlocks-feature1 = Level Map | |||
| api-enum-id = not_gate | |||
| api-enum-number = 1 | |||
}} | |||
This level is the first one where you get to design your own circuit. The task here is to create a circuit that outputs the opposite of the input. | This level is the first one where you get to design your own circuit. The task here is to create a circuit that outputs the opposite of the input. | ||
| Line 8: | Line 21: | ||
! Input !! Output | ! Input !! Output | ||
|- | |- | ||
| {{ | | {{Off t}}|| {{On t}} | ||
|- | |- | ||
| {{ | | {{On t}}|| {{Off t}} | ||
|} | |} | ||
Latest revision as of 23:50, 1 September 2024
| Section | Basic Logic |
|---|---|
| Type | Component |
| Prerequisite | Crude Awakening |
| Unlocks | AND Gate NOR Gate OR Gate |
| NOT | |
| Level Map | |
| Scored | No |
| API | not_gate (1) |
This level is the first one where you get to design your own circuit. The task here is to create a circuit that outputs the opposite of the input.
| Input | Output |
|---|---|
 0 |
 1
|
1 |
0
|
To solve this level place one NAND gate and connect both of its inputs to the input pin on the left, then connect the output of the gate to the output pin on the right.