Talk:Wigner's Fuckbuddy Is A Superposition of Top And Bottom

From Esolang
Jump to navigation Jump to search

Note that it's not generally believed that quantum computers can solve NP-complete problems in polynomial time (whether they can or not is a problem that's of similar difficulty to P=NP, although obviously P=NP would imply they could). It thus seems reasonable that quantum computers could exist without making this language computable at the given complexities. --ais523 13:22, 9 November 2013 (UTC)

My personal belief is that nothing that can literally obey this spec will ever exist (p>0.95), though high-qubit quantum computers will exist sooner than it seems like they might based on current progress (<20 years to 1000+ coherent qubits, p>0.85). --Quintopia (talk) 04:36, 10 November 2013 (UTC)