(Added image and spoiler markers) |
(Added infobox) |
||
Line 1: | Line 1: | ||
{{Header Nav|game=Turing Complete}} | {{Header Nav|game=Turing Complete}} | ||
{{infobox level | |||
| section = Arithmetic | |||
| type = component | |||
| prerequisite1 = 1 Bit Decoder | |||
| dependency1 = Logic Engine | |||
| dependency2 = Registers | |||
| unlocks1 = 3 bit decoder | |||
}} | |||
{{spoilerspage}} | {{spoilerspage}} | ||
Revision as of 02:09, 3 November 2023
Section | Arithmetic |
---|---|
Type | component |
Prerequisite | 1 Bit Decoder |
Scored | No |
API | {{{api-enum-id}}} ({{{api-enum-number}}}) |
The 3 bit decoder is made by 8 AND gates and 3 NOT.
Solution
Another possible option is to use 8 AND gates and 3 1-bit decoders, tho again, this is just another of a host of possible alternatives.