From: David Picón Álvarez (email@example.com)
Date: Sun Nov 25 2007 - 11:07:07 MST
> Only if you can prove Goldbach's conjecture up to 2^memory_size. So far
> has only been proven to hold for up to about 3.33 x 10^17. Nor is there
> proof that there is no proof if it is true.
Point being that for a feasible memory size it can be proven. You don't need
to hold just the number but also enough memory to do the prime sums. The
more general point being that a program doesn't run on an abstract machine,
it runs on an actual machine, with finite constraints, and such systems are
a lot more predictable.
This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:01 MDT