Content deleted Content added
Jasper Deng (talk | contribs) →Citation?: re |
Fulldecent (talk | contribs) →Shannon is not an example: new section |
||
Line 11:
This makes no sense and isn't cited. Is it correct? Galactic algorithm are impractically because they involve data that isn't in practice used? Increased 'Computer sizes' won't change that. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/61.68.214.83|61.68.214.83]] ([[User talk:61.68.214.83#top|talk]]) 11:02, 5 October 2019 (UTC)</small> <!--Autosigned by SineBot-->
:Data sizes also catch up too. For example, the [[AKS test]] at some point must begin outperforming all other known deterministic primality tests, and it's possible that future computer sizes will realize that. The [[Strassen algorithm]] would not have been practical on early computers (today's data matrices are far larger than anything back then). Even with quantum computers, [[Shor's algorithm]] is arguably galactic at this time as it is impractical for all but the smallest integers at this time, even though we believe we can construct quantum computers of sufficient size to make it more practical than classical algorithms.--[[User:Jasper Deng|Jasper Deng]] [[User talk:Jasper Deng|(talk)]] 11:10, 5 October 2019 (UTC)
== Shannon is not an example ==
Shannon's coding example is not related to the scale of the input and therefore it is not a galactic algorithm. [[User:Fulldecent|Full Decent]] ([[User talk:Fulldecent|talk]]) 17:18, 5 October 2019 (UTC)
| |||