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

It's not necessary. Just interpret the bits as coefficients of powers of 2, in a purely conventional manner. Say that leading digits match the high bit rather than being 0 regardless of the high bit. And you're done, you have working signed arithmetic that displays all the behavior you expect and conforms to the geometric series equality. Here 1 + 2 + 4 + ... = -1 in the integers.



Consider applying for YC's Spring batch! Applications are open till Feb 11.

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

Search: