Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
| Hi-index | 0.00 |
This article describes a novel first theory course, entitled "Models of Computation, " that I've been teaching at Brown University for the last three years with considerable success. In fact, many students tell me that they enjoy it very much, a somewhat unusual reaction for a required theory course. I believe its appeal is due to my efforts to make the material relevant to their experience and interests by introducing new topics, namely, circuits, computer organization, and programming, and covering the standard material in an unusual order. Highlights of the course are that students acquire a good understanding of NP-complete languages by midsemester, learn almost all of the material normally taught in a theory course on formal languages and automata and computability, and develop a very good appreciation for the importance of reductions in theoretical (and non-theoretical) computer science. More information on the course can be found at www.cs.brown.edu/courses/cs051.