DMCA
Models of Computation -- Exploring the Power of Computing
| Citations: | 81 - 6 self |
BibTeX
@MISC{Savage_modelsof,
author = {John E. Savage},
title = {Models of Computation -- Exploring the Power of Computing },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Theoretical computer science treats any computational subject for which a good model can be created. Research on formal models of computation was initiated in the 1930s and 1940s by Turing, Post, Kleene, Church, and others. In the 1950s and 1960s programming languages, language translators, and operating systems were under development and therefore became both the subject and basis for a great deal of theoretical work. The power of computers of this period was limited by slow processors and small amounts of memory, and thus theories (models, algorithms, and analysis) were developed to explore the efficient use of computers as well as the inherent complexity of problems. The former subject is known today as algorithms and data structures, the latter computational complexity. The focus of theoretical computer scientists in the 1960s on languages is reflected in the first textbook on the subject, Formal Languages and Their Relation to Automata by John Hopcroft and Jeffrey Ullman. This influential book led to the creation of many languagecentered theoretical computer science courses; many introductory theory courses today continue to reflect the content of this book and the interests of theoreticians of the 1960s and early 1970s. Although
Keyphrases
inherent complexity small amount first textbook many introductory theory course today formal language slow processor theoretical computer scientist formal model programming language data structure computational subject former subject language translator great deal influential book theoretical work jeffrey ullman good model latter computational complexity john hopcroft efficient use theoretical computer science
