|
NOTE: Course information changes frequently. Please re-visit these pages periodically for the most recent and up-to-date information. | |
Fall 2013 Computer Science W3261 section 001 COMPUTER SCIENCE THEORY | |
| Call Number | 28863 |
| Day & Time Location |
MW 1:10pm-2:25pm To be announced |
| Points | 3 |
| Approvals Required | None |
| Instructor | Mihalis Yannakakis |
| Type | LECTURE |
| Course Description | Prerequisites: COMS W3203 Corequisites: COMS W3137 Regular languages: deterministic and non-deterministic finite automata, regular expressions. Context-free languages: context-free grammars, push-down automata. Turing machines, the Chomsky hierarchy, and the Church-Turing thesis. Introduction to Complexity Theory and NP-Completeness. |
| Web Site | CourseWorks |
| Department | Computer Science |
| Enrollment | 92 students (110 max) as of 12:21AM Saturday, May 18, 2013 |
| Subject | Computer Science |
| Number | W3261 |
| Section | 001 |
| Division | Interfaculty |
| Open To | Columbia College, Engineering and Applied Science, General Studies, School of Continuing Education, Graduate School of Arts and Science, School of the Arts, International and Public Affairs, Barnard, Engineering and Applied Science: Graduate |
| Campus | Morningside |
| Section key | 20133COMS3261W001 |
Home About This Directory Online Bulletins ColumbiaWeb | |