Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Site Tools

  • AAAS
  • Subscribe
  • Feedback

Site Search

Search Advanced

Science 1 July 2005:
Vol. 309. no. 5731, p. 96
DOI: 10.1126/science.309.5731.96
Prev | Table of Contents | Next

News

What Are the Limits of Conventional Computing?

Charles Seife

Mathematicians have shown that if you could come up with a quick and easy shortcut to solving any one of the hardest type of computational problems, you'd be able to crack them all. But it's uncertain whether such a shortcut exists. Scientists think not, but proving it is one of the great unanswered questions in mathematics.

Read the Full Text

To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)