enter search term and/or author name
Three great challenges for half-century-old computer science
Frederick P. Brooks, Jr.
Some challenges and grand challenges for computational intelligence
Edward A. Feigenbaum
What next?: A dozen information-technology research goals
The verifying compiler: A grand challenge for computing research
This contribution proposes a set of criteria that distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the interest of scientists and engineers. As an example drawn...
Problems and projections in CS for the next 49 years
Why haven't more quantum algorithms been found?
Peter W. Shor
I examine the question of why so few classes of quantum algorithms have been discovered. I give two possible explanations for this, and some thoughts about what lines of research might lead to the discovery of more quantum algorithms.
Deterministic versus nondeterministic time and lower bound problems
Richard E. Stearns
Because many problems of general interest have natural nondeterministic algorithms and because computers act deterministically, it is important to understand the relationship between deterministic and nondeterministic time. Specifically, it is...
Classical physics and the Church--Turing Thesis
Andrew Chi-Chih Yao
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence suggests that this might be the case in the quantum world. But the question...