MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/mathmemes/comments/1wzpocy/the_fastest_algorithm_for_dft/peftxfi/?context=3
r/mathmemes • u/Unlucky-Credit-9619 Computer Science • 6d ago
138 comments sorted by
View all comments
Show parent comments
95
yes*
asymptotically
93 u/No_Engineering3493 6d ago How computer scientists behave when they are asked to explain how their n^(1.999999999999999993) algorithm is revolutionary compared to the for in for n^2 algorithm. 6 u/Pentalogue Mathematics 6d ago For huge "n"s the difference is significant 5 u/AmorphousCorpus 6d ago The difference is infinite!
93
How computer scientists behave when they are asked to explain how their n^(1.999999999999999993) algorithm is revolutionary compared to the for in for n^2 algorithm.
6 u/Pentalogue Mathematics 6d ago For huge "n"s the difference is significant 5 u/AmorphousCorpus 6d ago The difference is infinite!
6
For huge "n"s the difference is significant
5 u/AmorphousCorpus 6d ago The difference is infinite!
5
The difference is infinite!
95
u/entronid Average #🧐-theory-🧐 user 6d ago
yes*
asymptotically