I missed the beginning of this thread, but it seems like you're talking
about whether the Goldbach conjecture could fall into the class of
undecidable theorems. I don't know if anyone has pointed this out yet, but
the Goldbach conjecture cannot fall into that class. It is provable as true
or false.
1 - If you can provide a counterexample (an even number which is not the sum
of two primes), you have proven the Goldbach conjecture wrong.
2 - If the Goldbach conjecture is undecidable, it means that no
counterexample (as specified in point 1) exists.
3 - If no counterexample exists, this means there is no even number which is
not the sum of two primes, making the conjecture true.
---------------------------------------------------
Zeb Haradon (zebharadon@hotmail.com)
My personal webpage:
http://www.inconnect.com/~zharadon/ubunix
A movie I'm directing:
http://www.elevatormovie.com
"What is this, some Three Stooges episode where everyone is armed with pies?
Bill Gates is supposed to walk through the airport with an armful of pies
so that he can stoop to the level of his attackers?" -Chris Russo
_________________________________________________________________
Get your FREE download of MSN Explorer at http://explorer.msn.com
This archive was generated by hypermail 2b30 : Mon May 28 2001 - 09:59:44 MDT