4 ms·

From the article: "A galactic algorithm is an algorithm that is wonderful in its asymptotic behavior, but is never used to actual compute anything."

• phomer 7y ago
  Yes. Theoretically the algorithm is tractable, but the exponent is so large that it wouldn't be practical to run it in a real environment.
  • amelius 7y ago
    According to the article, the algorithm does not need to have a polynomial bound to be classified as "galactic".
    • phomer 7y ago
      It is mentioned a couple times explicitly, but I think most of the readers for this blog would know that the border line for tractable is polynomial growth. Still, it is an interesting observation, worth investigating.