Quantum Algorithms
Sunday, November 09, 2003

Beal's Conjecture
Peter Norvig has some classical algorithms to find counter-examples to "Beal's Conjecture." At a first glance it seems to be a well suited problem for a QC, since it is a bit like factoring big integers. When I get a chance, I'll try to come up with a qualgorithm and post it here.
Comments: Post a Comment

<< Home

Powered by Blogger