People & Ideas in Theoretical Computer Science
Springer, 1999 - Computers - 341 pages
Theory and theoreticians have played a major role in computer science. Many insights into the nature of efficient computations were gained and theory was crucial for some of the most celebrated engineering triumphs of computer science (e.g., in compiler design, databases, multitask operating systems, to name just a few). Theoretical computer science (TCS) functions as a communication bridge between computer science and other subjects, notably, mathematics, linguistics, biology; it is a champion in developing unconventional models of computation (DNA, quantum). This book collects personal accounts and reflections of fourteen eminent scientists who have dedicated themselves to the craft of TCS. Contributions focus on authors specific interests, experiences, and reminiscences. The emerging picture, which is just one among other possible ones, should be a catalyst for further developments and continuations. Was most interested to learn about the project, which should be a worthwhile one." N. Chomsky, MIT.
"The human story of creativity is inspiring and documents a very noble activity - the creation of knowledge in its most beautiful and useful form - the creation of a science. Supplying the technical and intellectual tools to probe some of the most fascinating questions about the nature of thought and intelligence, theoretical computer science is trying to grasp the limits of rational thought, the limits of knowable. This book will contribute to the understanding of the creation of a magnificent science." J. Hartmanis, NSF.
"This is obviously an extremely worthwhile project." D. E. Knuth, Stanford University.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Gregory J Chaitin
Edsger W Dijkstra
9 other sections not shown
A. A. Markov Academy of Sciences algebra algebra semantics algorithms analysis applications approach arithmetic Arto Salomaa automata theory axiomatic system Babai became binary category theory combinatorial computational complexity Conference construction course Davis defined developed Diophantine equations Diophantine representation Diophantine sets EATCS editors engineering fact finite formal axiomatic system formal languages friends graph Graz Grigoriev Hilbert's tenth problem ideas informatics Institute integer interesting Joseph Goguen Julia Robinson language theory later Leningrad linguistics LOMI Math mathematical logic mathematicians Matiyasevich Maurer Meseguer method models Moscow natural numbers number theory paper perebor Ph.D polynomial prime numbers professor programming language proof prove published r.e. set randomized algorithms Rozenberg Russian S-expression sauna scientific semantics seminar set theory solution solve Soviet specification Springer started structure theorem theoretical computer science thesis tion topic translation Turing machine undecidability University USSR