Galactic algorithm: Difference between revisions

Content deleted Content added
Citation bot (talk | contribs)
Add: authors 1-1. Removed proxy/dead URL that duplicated identifier. Removed parameters. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_webform 2161/3850
top: improve citation, replace url of an incomplete blog post with google books pages preview
Line 1:
{{Short description|Classification of algorithm}}
A '''galactic algorithm''' is one that outperforms any other algorithm 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 |authorlast1=Lipton, |first1=Richard J., and|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://rjliptonbooks.wordpressgoogle.com/2010/10/23/galactic-algorithms/books?id=eLC9BAAAQBAJ&pg=PA109 |isbn=9783642414220}}</ref> because they will never be used on any data sets on Earth.
 
== Possible use cases ==