Re:Proof Claimed for Deep Connection between Prime Numbers
by samstave on Tuesday September 11, 2012 @03:32AM
(#4504235)
Thanks, but I said in "lay" ("lag" due to stupid iPhone AC) terms...
I dont really get how your response answers my question.
Can you really dumb it down for me; explain like I am 5 how this will result in practical applications in the next (N) years.
thanks
Re:Proof Claimed for Deep Connection between Prime Numbers
by jgeralnik on Tuesday September 11, 2012 @04:00AM
(#4504306)
His answer was that he thinks there will be no practical applications from this proof, since it merely states that something exists without giving us an idea of how to find that thing.
Re:Proof Claimed for Deep Connection between Prime Numbers
by repsilat on Tuesday September 11, 2012 @07:07AM
(#4504753)
Yeah. For the most part non-constructive proofs are only good for proving things about existing algorithms - their convergence properties, their correctness, their running time etc. Formal proof often isn't necessary in practice, though - "seems to work well enough" is ok in many domains.
Of course, this isn't to say that new mathematics based on the result and on the techniques used to prove it won't lead to new algorithms.
Re:Proof Claimed for Deep Connection between Prime Numbers
by sixQuarks on Tuesday September 11, 2012 @01:08PM
(#4506535)
Here is the best layman's explanation I could find:
http://i.imgur.com/VrjiG.gif
I am not at all qualified to talk about the claimed proof, but I think it would be nonconstructive.