Talk:Transcomputational problem
Appearance
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. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | Computer science Unassessed | ||||||||||||||||
|
Testing integrated circuits – 2^308?
MATLAB gives: , whereas . 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)
- 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)
- 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)
- 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)
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)