Toggle search
Search
Toggle menu
notifications
Toggle personal menu
Editing
Level/Adding Bytes
From Turing Complete
Views
Read
Edit
Edit source
View history
associated-pages
Page
Discussion
More actions
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Infobox level | section = Arithmetic | type = Component | prerequisite1 = Double the Number | prerequisite2 = Full Adder | prerequisite3 = Bit Switch | unlocks-level1 = Negative Numbers | unlocks-level2 = Input Selector | unlocks-component1 = Add | scored = Yes | highscore = 83 | api-enum-id = byte_adder | api-enum-number = 16 }} In this level, you are tasked with designing a component that can ADD together two byte values. To accomplish this, you will need to use the 1-bit Adder component (call Full Adder) you created earlier on to perform bitwise addition on the two numbers. To complete the level, you will need ''two'' '''{{Component|Byte Splitter}}''' components, one '''{{Component|8 Bit Maker}}''' component, and ''eight'' '''{{Component|Full Adder|Full Adders}}'''. First, hook up each byte input node to a Byte Splitter, so you can start working with each value bit-by-bit. Next, for each pair of bits between each byte value (each first bit, each second bit, etc.), you will need to use one Adder component to perform addition on the two bits. For each pair of bits between the two bytes, hook them up to a Full Adder component to add the two bits together. Consolidate the outputs of each Adder using a 8 Bit Maker component, and link its restored byte output to the level's byte output node. Also notice that the level has an input and an output for a Carry bit. This is where the third bit in the 1-bit Full Adder component comes in handy, as it allows those components to be chained together in order to add together arbitrarily large numbers. To integrate the Carry functionality into this component, first connect the level's Carry bit input node up to the third input of the first Full Adder component. Then connect each Adder component's second output to the next Adder's third input. Continue chaining the components together for each of the eight Adder components, and for the final Adder, link its Carry output to the level's Carry output node itself. From here, the level will be complete.
Summary:
Please note that all contributions to Turing Complete are considered to be released under the Creative Commons Attribution-ShareAlike (see
TuringComplete:Copyrights
for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource.
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Templates used on this page:
Template:Component
(
edit
)
Template:Ifnotempty
(
edit
)
Template:Infobox level
(
edit
)
Template:Level
(
edit
)
Template:P1
(
edit
)
Template:P2
(
edit
)
Template:Truthtable/styles.css
(
edit
)