steve@ragman (Steve Stevenson) (01/25/89)
I want to teach a seminar this summer which would emphasize the development
of ``computational science'' through the seminal problems which have motivated
researchers throughout history. The seminar will conclude with a look
at the ``most important'' open problems. This brings up the nasty
issue of identifying said things.
To set some sort of tone, Hilbert's problems should be included since it
led to Turing's paper. The question of completeness led to Goedel's
results. Surely 3-satisfiability. The four-color conjecture.
Complementation of context sensitive languages. I would include such
things as the Dining Philosphers problem as a motivator for solutions to
sharing. I would also include problems with asynchronous sequential circuits
as a motivator for clocks. Numerical problems as well as number theory
problems also welcome.
Please submit your nominations to me via e-mail. I will summarize and
distribute.
==============================cut here================================
Problem Name:
Problem Synopsis: (keep it short)
Problem Reference: (a ready reference to statement of problem)
Solution Reference: (a ready reference a solution if it exists)
======================================================================
Steve (really "D. E.") Stevenson steve@hubcap.clemson.edu
fpst@hubcap.clemson.edu
Department of Computer Science, (803)656-5880.mabell
Clemson University, Clemson, SC 29634-1906