Revision as of 19:40, 10 June 2022 edit 2a02:2f04:405:d600:f516:46b1:9c42:4fa2 (talk) →Quantum Computing ← Previous edit		Revision as of 19:41, 10 June 2022 edit undo SineBot (talk \| contribs) Bots 2,564,776 edits m Signing comment by 2A02:2F04:405:D600:F516:46B1:9C42:4FA2 - "→Quantum Computing: " Next edit →
Line 24: :That's not how quantum computing works. Not only does quantum computing not make everything magically O(1), not all algorithms speed up in the same way: see [[post-quantum cryptography]] for some discussion. -- [[User:The Anome\|The Anome]] ([[User talk:The Anome\|talk]]) 19:03, 21 February 2017 (UTC) :: Even if not all programs benefit from the speed-up when run on a quantum computer.. it does show that this "transcomputational problem" term won't age well and may become inacurate and a source of confusion in the future. I'm really just refering to the <math>2^{93}</math> number. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/2A02:2F04:405:D600:F516:46B1:9C42:4FA2\|2A02:2F04:405:D600:F516:46B1:9C42:4FA2]] ([[User talk:2A02:2F04:405:D600:F516:46B1:9C42:4FA2#top\|talk]]) 19:40, 10 June 2022 (UTC)</small> <!--Autosigned by SineBot--> == "Any number greater than 10^93 is called a transcomputational number" ==

Talk:Transcomputational problem: Difference between revisions