Timeline for When adding binary numbers, how do you just ignore the overflow?
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 10, 2019 at 23:46 | vote | accept | fred | ||
| Jan 10, 2019 at 23:46 | vote | accept | fred | ||
| Jan 10, 2019 at 23:46 | |||||
| Nov 23, 2018 at 13:23 | answer | added | TripeHound | timeline score: 1 | |
| S Nov 23, 2018 at 8:11 | history | suggested | manassehkatz-Moving 2 Codidact | CC BY-SA 4.0 |
spelling & grammar, formatting, replace image with text.
|
| Nov 23, 2018 at 2:45 | review | Suggested edits | |||
| S Nov 23, 2018 at 8:11 | |||||
| Nov 23, 2018 at 2:06 | comment | added | Spehro 'speff' Pefhany | Adding two 2’s complement numbers with different signs can never cause an overflow. | |
| Nov 22, 2018 at 23:07 | answer | added | thb | timeline score: 3 | |
| Nov 22, 2018 at 23:01 | answer | added | Dave Tweed | timeline score: 4 | |
| Nov 22, 2018 at 23:00 | history | edited | fred | CC BY-SA 4.0 |
added 97 characters in body
|
| Nov 22, 2018 at 22:48 | comment | added | Hearth | Ignoring the overflow bit is what makes two's complement work. Computers always work in a predefined number of bits. | |
| Nov 22, 2018 at 22:42 | history | asked | fred | CC BY-SA 4.0 |