Content deleted Content added
→Testing integrated circuits – 2^308?: It is an upper limit with the assumption that you know nothing about the chip being tested. |
|||
Line 23:
: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)
== "Any number greater than 10^93 is called a transcomputational number" ==
The page currently opens with "a transcomputational problem is a problem that requires processing of more than 10^93 bits of information", then says, "[a]ny number greater than 10^93 is called a transcomputational number". Is this consistent? If we're talking about processing information in excess of 10^93 bits, I might expect the label "transcomputational number" apply to those numbers greater than 2^(10^93). It seems worth clarifying the discrepancy between "n bits" and "n", or correcting the description in some other way.
| |||