No, provably is correct. Depending on the problem, SA algorithms may or may not probably find the best solution. But in all cases, they cannot prove their solution is optimal.
A '''galactic algorithm''' is one that outperforms any other algorithmalgorithms for problems that are sufficiently large, but where "[[sufficiently large]]" is so big that the algorithm is never used in practice. Galactic algorithms were so named by [[Richard Lipton]] and Ken Regan,<ref name="seminal">{{cite book |last1=Lipton |first1=Richard J. |author-link1=Richard Lipton|first2=Kenneth W. |last2=Regan |chapter=David Johnson: Galactic Algorithms |title=People, Problems, and Proofs: Essays from Gödel's Lost Letter: 2010 |publisher=Springer Berlin |___location=Heidelberg |year=2013 |pages=109–112 |chapter-url=https://books.google.com/books?id=eLC9BAAAQBAJ&pg=PA109 |isbn=9783642414220}}</ref> because they will never be used on any data sets on Earth.
