Talk:Transcomputational problem

This is the talk page for discussing improvements to the Transcomputational problem article.
This is not a forum for general discussion of the article's subject.

Put new text under old text. Click here to start a new topic.
New to Wikipedia? Welcome! Learn to edit; get help.

Article policies

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL

Computer science Unassessed

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

???

This article has not yet received a rating on Wikipedia's content assessment scale.

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Testing integrated circuits – 2^308?

MATLAB gives: $\log _{10}{2^{308}}\approx 92.7172$ , whereas $\log _{10}{2^{309}}\approx 93.0183$ . So the first integer power of 2 that is actually a transcomputational number is the 309th. This is why I change the example accordingly. --Doubaer (talk) 11:50, 23 April 2013 (UTC)[reply]

Alas, while your math appears to be correct, the source cited says 308, not 309. See WP:V and WP:OR. You need to find a reliable source that has the correct figure, then you can correct the page with a citation to your source. --Guy Macon (talk) 19:54, 23 April 2013 (UTC)[reply]

I see. However, if a formally reliable source can positively be proven wrong, shouldn't either the whole information should be completely removed, or at least a note be indicating that there is an obvious error in the cited source? --Doubaer (talk) 10:49, 8 October 2013 (UTC)[reply]

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. --MarioS (talk) 14:37, 30 January 2014 (UTC)[reply]

[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³⁰⁹ 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? comp.arch (talk) 11:56, 18 November 2014 (UTC)[reply]

Quantum Computing

It seems quantum computing technology will take off within maybe 50 years. A quantum computer with 500 bits can simultaneously simulate all the possible configurations of a regular computer with 2^500 bits. This should be mentioned somewhere in the article. — Preceding unsigned comment added by Blurrr2 (talk • contribs) 17:57, 4 June 2014 (UTC)[reply]

That's not how quantum computing works. Not all algorithms speed up in the same way: see post-quantum cryptography for some discussion. -- The Anome (talk) 19:03, 21 February 2017 (UTC)[reply]