Galactic algorithm: Difference between revisions

Revision as of 02:24, 24 November 2023

Revision as of 02:25, 24 November 2023

Line 1:

{{Short description|Classification of algorithm}}

{{original research|date=November 2023}}

A '''galactic algorithm''' is one that outperforms other algorithms 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.