If I ask another professor what he teaches in the introductory programming course, whether he answers proudly "Pascal" or diffidently "FORTRAN," I know that he is teaching a grammar, a set of semantic rules, and some finished **algorithms**, leaving the students to discover, on their own, some process of design.

For having a clear influence on methodologies for the creation of efficient and reliable software, and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic program synthesis, and analysis of **algorithms**.

1978 Turing Award Citation[3]

**algorithms** are the computational content of proofs.

Mathematics my foot! **algorithms** are mathematics too, and often more interesting and definitely more useful.

The Narrow-Minded and Ignorant Referee's Report [and Zeilberger's Response] of Zeilberger's Paper "Automaric CounTilings" that was rejected by Helene Barcelo and the Members of the Advisory Board [that includes(!) Enumeration Expert Mireille Bousquet-Melou] of the Journal of Combinatorial Theory-Series A. [1]

**algorithms** existed for at least five thousand years, but people did not know that they were algorithmizing. Then came Turing (and Post and Church and Markov and others) and formalized the notion.

Create and save customized word lists. Sign up today and start improving your vocabulary!