Galactic Algorithm Fourier Transform

Galactic algorithm From Wikipedia, the free encyclopedia A galactic algorithm is one that runs faster than 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,[1] as they will never be used on any of the merely terrestrial data sets we find here on Earth. An example of a galactic algorithm is the fastest known way to multiply two numbers,[2] which is based on a 1729-dimensional Fourier transform.[3][4] This means it will not reach its stated efficiency until the numbers have at least 2^1729 digits, (vastly) more digits than there are atoms in the universe. So this algorithm is never used in practice. MULTIPLYING TWO INTEGERS BETTER DO A 1729-DIMENSIONAL FOURIER TRANSFORM

На изображении показана шуточная страница Википедии о «галактическом алгоритме», который теоретически быстрее обычных алгоритмов, но применим только к невероятно огромным числам. Внизу космический человек выбирает 1729-мерное преобразование Фурье даже для простого умножения двух целых чисел. Шутка высмеивает непрактичную теоретическую оптимизацию и отправляется как реакция на чрезмерно сложное решение простой задачи. EN: The image shows a spoof Wikipedia page about a “galactic algorithm” that is theoretically faster than ordinary algorithms but only applies to impossibly large numbers. Below, a cosmic figure chooses a 1729-dimensional Fourier transform even for simply multiplying two integers. The joke mocks impractical theoretical optimization and is used as a reaction to an absurdly overcomplicated solution to a simple problem.

• @profunctor_io / 3477 2019-11-19
• @dev_meme / 842 2019-11-22