Content deleted Content added
m Signing comment by Blurrr2 - "" |
|||
Line 11:
:::I absolutely agree. The source says "what we are saying is that 2^308 is greater than 10^93", which is not the case. Citing a source for something that is clearly wrong does not make it right. Anyway, the source still supports the statement: If 2^308 is transcomputational, then 2^309 is as well. I will go ahead and change it. --[[User:MarioS|MarioS]] ([[User talk:MarioS|talk]]) 14:37, 30 January 2014 (UTC)
[Not commenting on above (a factor of ten less is "practically" transcomputational I would think).]
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 hovever (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)
== Quantum Computing ==
| |||