Revision as of 11:56, 18 November 2014 edit Comp.arch (talk \| contribs) Extended confirmed users 41,494 edits m →Testing integrated circuits – 2^308? ← Previous edit		Revision as of 11:57, 18 November 2014 edit undo Comp.arch (talk \| contribs) Extended confirmed users 41,494 edits m →Testing integrated circuits – 2^308? Next edit →
Line 14: [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~~"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) == Quantum Computing ==

Talk:Transcomputational problem: Difference between revisions