Re:Rent-a-coder hilarity (2008)
by kens on Monday May 06, 2013 @02:53AM
(#5661200)
A simple example that is hard to determine if it halts is to iterate through a,b,c,n and see if a^n+b^n=c^n. I.e. solve Fermat's last theorem by brute force. (I won't spell out the iteration details.) If your software could determine if this halts or not, it would prove Fermat's last theorem. (Obviously since FLT has been proven, this particular case is known not to halt.)
[ Parent
| on HN ]
Interesting read:
"The proof itself is over 100 pages long and consumed seven yearsof Wiles's research time. For solving Fermat's Last Theorem, he was knighted, and received other honors."
http://en.wikipedia.org/wiki/Wiles%27s_proof_of_Fermat%27s_L...