Computer Science Theory
Class meets 1:10-2:25pm, Mondays and Wednesdays, 833 Mudd.
Final will be Monday, December 8, 2014.
Students whose last names begin A-R should go to room 833 Mudd.
Students whose last names begin S-Z should go to room 627 Mudd.
Course webpage: https://www.cs.columbia.edu/~aho/cs3261
Courseworks website: https://courseworks.columbia.edu
Piazza bulletin board: https://piazza.com/columbia/fall2014/comsw3261
In Computer Science Theory you will learn computational thinking
and get to know the fundamental models of computation that underly
modern computer hardware, software, and programming languages.
You will also discover that there are limits on how quickly computers
can solve some problems and that there are some
problems that no computer can solve.
The course will cover the important formal languages in the Chomsky hierarchy -- the regular sets, the context-free languages, and the recursively enumerable sets -- as well as the formalisms that generate these languages and the machines that recognize them. The course will also introduce the basic concepts of computability and complexity theory by focusing on the question, "What are the fundamental capabilities and limitations of computers?"
The concepts covered in this course will be amply illustrated by applications to current programming languages, algorithms, natural language processing, and hardware and software design.
|Pre- or Corequisites|
|COMS W3137 Data Structures and Algorithms|
|COMS W3203 Discrete Mathematics|
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman
Introduction to Automata Theory, Languages, and Computation, Third Edition
Pearson/Addison-Wesley, 2007, ISBN 0-321-45536-3
Introduction to the Theory of Computation, Third Edition
Cengage Learning, 2013
Alfred V. Aho and Jeffrey D. Ullman
Foundations of Computer Science, C Edition
W. H. Freeman, 1995
An online version of this book is available here.
20 % Best four homeworks out of five
40 % Midterm
40 % Final
|email@example.com||Updated September 11, 2014|