2 ms·
Previous submission 2017: https://news.ycombinator.com/item?id=15252426 https://news.ycombinator.com/item?id=15252426 Can't believe this was already 3 years a
by ascar 6y ago
Previous submission 2017:
https://news.ycombinator.com/item?id=15252426 https://news.ycombinator.com/item?id=15252426
Can't believe this was already 3 years ago. Interesting read!
Previous submission 2014:
https://news.ycombinator.com/item?id=7135261 https://news.ycombinator.com/item?id=7135261
- tape_measure 6y agoYes, I originally came across this on HN, likely in 2017 based on my surrounding bookmarks. It has stuck with me ever since even though I don't do much programming anymore. At the time, I was a TA in a MATLAB course, so I tried to emphasize that the code runs on a machine and is fundamentally discrete. (.1 + .2 == .3) returning false is an easy way into this concept. 32 bits (and now 64 as @dragontamer calculated) is a huge input space. You could verify 4 int_8 or 2 char[2] functions.