ACM DL

Journal of the ACM (JACM)

Menu

Search Issue
enter search term and/or author name

Archive


Journal of the ACM (JACM), Volume 50 Issue 1, January 2003

JACM's 50th anniversary
Joseph Y. Halpern
Pages: 3-7
DOI: 10.1145/602382.602383

JACM editors-in-chief
Journal of the ACM staff
Pages: 9-9
DOI: 10.1145/602382.602385

Journal of the ACM---the beginnings
Franz Alt
Pages: 10-11
DOI: 10.1145/602382.602386

Transitions 1959--1964
Mario L. Juncosa
Pages: 12-13
DOI: 10.1145/602382.602387

A Golden Age for JACM
C. C. Gotlieb
Pages: 14-14
DOI: 10.1145/602382.602388

JACM 1973--1975
Ray Miller
Pages: 15-15
DOI: 10.1145/602382.602389

JACM 1976--1979
Ed Coffman
Pages: 16-16
DOI: 10.1145/602382.602390

JACM 1983--1986
Michael J. Fischer
Pages: 17-17
DOI: 10.1145/602382.602391

JACM 1986--1990
Daniel J. Rosenkrantz
Pages: 18-18
DOI: 10.1145/602382.602392

JACM 1991--1997
Tom Leighton
Pages: 19-19
DOI: 10.1145/602382.602393

A report from Headquarters
Mark Mandelbaum
Pages: 21-23
DOI: 10.1145/602382.602395

Three great challenges for half-century-old computer science
Frederick P. Brooks, Jr.
Pages: 25-26
DOI: 10.1145/602382.602397

The importance of the P versus NP question
Stephen Cook
Pages: 27-29
DOI: 10.1145/602382.602398

On computer system challenges
Fernando J. Corbató
Pages: 30-31
DOI: 10.1145/602382.602399

Some challenges and grand challenges for computational intelligence
Edward A. Feigenbaum
Pages: 32-40
DOI: 10.1145/602382.602400

What next?: A dozen information-technology research goals
Jim Gray
Pages: 41-57
DOI: 10.1145/602382.602401

Separation of complexity classes
Juris Hartmanis
Pages: 58-62
DOI: 10.1145/602382.602402

The verifying compiler: A grand challenge for computing research
Tony Hoare
Pages: 63-69
DOI: 10.1145/602382.602403
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...

Getting computers to understand
Butler Lampson
Pages: 70-72
DOI: 10.1145/602382.602404

Problems and projections in CS for the next 49 years
John McCarthy
Pages: 73-79
DOI: 10.1145/602382.602405

Propositional proof complexity
Alexander Razborov
Pages: 80-82
DOI: 10.1145/602382.602406

Three open problems in AI
Raj Reddy
Pages: 83-86
DOI: 10.1145/602382.602407

Why haven't more quantum algorithms been found?
Peter W. Shor
Pages: 87-90
DOI: 10.1145/602382.602408
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
Pages: 91-95
DOI: 10.1145/602382.602409
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...

Three problems in computer science
Leslie G. Valiant
Pages: 96-99
DOI: 10.1145/602382.602410

Classical physics and the Church--Turing Thesis
Andrew Chi-Chih Yao
Pages: 100-105
DOI: 10.1145/602382.602411
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...