On Thursday, 23 November 2017 at 00:15:56 UTC, Ola Fosheim
Grostad wrote:
On Thursday, 23 November 2017 at 00:06:49 UTC, codephantom
wrote:
true up to a number < n ... does not address the conjecture
correctly.
So what? We only need to a proof up to N for regular
programming, if at all.
That's really the point I was making.
It's the reason you'll never be able to put your complete trust
in a compiler.
The compiler can only ever know something, about something, up to
a point.
That's why we have the concept of 'undefined behaviour'.
