Content deleted Content added
→Quantum Computing: Not only does quantum computing not make everything magically O(1), |
→Testing integrated circuits – 2^308?: It is an upper limit with the assumption that you know nothing about the chip being tested. |
||
Line 15:
What does this mean however: "Exhaustively testing all combinations of an integrated circuit with 309 inputs and 1 output requires testing of a total of 2<sup>309</sup> combinations of inputs." I know most ''gates'' have far fewer inputs but whole chips have more "inputs" however (and more outputs). I think the number of outputs doesn't matter (more no less difficult), but can we say that testing all "realworld chips" (more pins/inputs) is impossible? Chips have structure and would this only apply in general but not for actual chips? [[User:Comp.arch|comp.arch]] ([[User talk:Comp.arch|talk]]) 11:56, 18 November 2014 (UTC)
:It is an upper limit with the assumption that you know nothing about the chip being tested. Imagine that 16 of those inputs connect internally to a 16-input exclusive or gate. Once you have tested the 2^16 input combinations and confirmed that the xor gate works, you can reduce those 2^308 combinations to 2^293. likewise, you don't need to test for every memory cell interfering with every other memory cell. You can just test the ones that are close to each other and ignore the possibility that a memory cell affects another memory cell on the other side of the die (and nothing else). --[[User:Guy Macon|Guy Macon]] ([[User talk:Guy Macon|talk]]) 20:03, 21 February 2017 (UTC)
== Quantum Computing ==
| |||