3 ms·
A 32-bit adder is just 4 8-bit adders with carry connected. I don't see why it'd be significantly more difficult.
by torginus 4y ago
A 32-bit adder is just 4 8-bit adders with carry connected. I don't see why it'd be significantly more difficult.
- GTP 4y agoYes, but the adder that the NN came up with has no carry.
- amelius 4y agoCarry is just the 9th bit?
- GTP 4y agoNot really, to compose adders you need specific lines for carry.
- deleted 4y ago[deleted]
- stabbles 4y agoIt's better to say the NN "converged to" something than "came up with" something.
- canadianfella 4y agoWhy?
- stabbles 4y agoThere is no intelligence or reasoning involved in stochastic gradient descent
- sebzim4500 4y agoIt's not harder computationally but finding that solution with SGD might be hard. I'd be really interested in the results.
- dehrmann 4y agoIn my EE class that discussed adders, we learned this wasn't exactly true. A lot of adders compute the carry bit separately because it takes time to propagate if you actually capture it as output.
- Cyph0n 4y agoFor a naive adder, sure. Actual adder circuits use carry lookahead. The basic idea is to “parallelize” carry computation as much as possible. As with anything else, there is a cost: area and power. Edit: This wiki page has a good explanation of the concept: https://en.wikipedia.org/wiki/Carry-lookahead_adder https://en.wikipedia.org/wiki/Carry-lookahead_adder
- gyorgytamas 4y ago[flagged]