m (Gelthor moved page Turing Complete/1 Bit Decoder to Level/1 Bit Decoder without leaving a redirect) |
(Added infobox) |
||
| Line 1: | Line 1: | ||
{{Header Nav|game=Turing Complete}} | {{Header Nav|game=Turing Complete}} | ||
{{infobox level | |||
| section = Arithmetic | |||
| type = Component | |||
| prerequisite1 = Saving Bytes | |||
| dependency1 = 3 Bit Decoder | |||
| dependency2 = Little Box | |||
| unlocks1 = 1 Bit decoder | |||
}} | |||
This level asks you to make a circuit that outputs On to one of two pins depending on the input signal. | This level asks you to make a circuit that outputs On to one of two pins depending on the input signal. | ||
==Solution== | |||
As the truth table reveals, one output is the inverse of the input and the other is a copy of the input. So add a Not Gate for the first output and wire things up. | As the truth table reveals, one output is the inverse of the input and the other is a copy of the input. So add a Not Gate for the first output and wire things up. | ||
{{Spoiler| | |||
[[File:Turing Complete 1 Bit Decoder.png]] | [[File:Turing Complete 1 Bit Decoder.png]] | ||
}} | |||
{{Footer Nav|game=Turing Complete|prevpage=Signed Negator|nextpage=3 Bit Decoder}} | {{Footer Nav|game=Turing Complete|prevpage=Signed Negator|nextpage=3 Bit Decoder}} | ||
Revision as of 02:07, 3 November 2023
| Section | Arithmetic |
|---|---|
| Type | Component |
| Prerequisite | Saving Bytes |
| Scored | No |
| API | {{{api-enum-id}}} ({{{api-enum-number}}}) |
This level asks you to make a circuit that outputs On to one of two pins depending on the input signal.
Solution
As the truth table reveals, one output is the inverse of the input and the other is a copy of the input. So add a Not Gate for the first output and wire things up.
Spoiler
