Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
FartyMcFarter
17 days ago
|
parent
|
context
|
favorite
| on:
Formalizing Fermat's Last Theorem
Stack overflows are also trivial to check for, if one wants to. It's just comparing two pointers, plus checking for arithmetic overflow (in case the pointers run past the maximum value of the pointer type).
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: