m (Use ON & OFF in truth table) |
(Added infobox) |
||
| Line 1: | Line 1: | ||
{{Header Nav|game=Turing Complete}} | {{Header Nav|game=Turing Complete}} | ||
{{Infobox level | |||
| section = Basic Logic | |||
| type = Component | |||
| prerequisite1 = AND Gate | |||
| prerequisite2 = NOR Gate | |||
| prerequisite3 = OR Gate | |||
| unlocks-level1 = Second Tick | |||
| unlocks-component1 = ON | |||
| unlocks-component2 = OFF | |||
| unlocks-page1 = De Morgan's laws | |||
| api-enum-id = always_on | |||
| api-enum-number = 2 | |||
}} | |||
For this level you have to create a circuit that always outputs true. | For this level you have to create a circuit that always outputs true. | ||
Latest revision as of 23:56, 1 September 2024
| Section | Basic Logic |
|---|---|
| Type | Component |
| Prerequisites | AND Gate NOR Gate OR Gate |
| Unlocks | Second Tick |
| ON OFF | |
| De Morgan's laws | |
| Scored | No |
| API | always_on (2) |
For this level you have to create a circuit that always outputs true.
| Input | Output |
|---|---|
 0 |
 1
|
1 |
1
|
To do this just take one of NAND, NOR, or NOT gates and hook up only the output to the output pin.