Hacker News new | past | comments | ask | show | jobs | submit login

A 32-bit adder is just 4 8-bit adders with carry connected. I don't see why it'd be significantly more difficult.



For 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


It's not harder computationally but finding that solution with SGD might be hard. I'd be really interested in the results.


In 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.


Yes, but the adder that the NN came up with has no carry.


It's better to say the NN "converged to" something than "came up with" something.


Why?


There is no intelligence or reasoning involved in stochastic gradient descent


Carry is just the 9th bit?


Not really, to compose adders you need specific lines for carry.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: