2014-2016 Undergraduate and Graduate Bulletin (without addenda) 
    
    Nov 25, 2024  
HELP
2014-2016 Undergraduate and Graduate Bulletin (without addenda) [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CS-GY 6753 Theory of Computation

3 Credits
This course introduces the theory of computation. Topics: Formal languages and automata theory. Deterministic and non-deterministic finite automata, regular expressions, regular languages, context-free languages. Pumping theorems for regular and context-free languages. Turing machines, recognizable and decidable languages. Limits of computability: the Halting Problem, undecidable and unrecognizable languages, reductions to prove undecidability. Time complexity, P and NP, Cook-Levin theorem, NP completeness.

Prerequisite(s): Graduate status and CS-GY 6003  or instructor’s permission.
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Catalog Navigation
  Bulletin Home
  School Profile
  Administration
  Administrative Offices
  Communication Policy
  School Compliance and Other Guidelines
  Statistics on Enrollment and the Student Body
  Admissions, Financial Aid, Tuition and Fees
  NYU Calendars
  Undergraduate Academic Requirements and Policies
  Graduate Academic Requirements and Policies
  Academic Department, Degree and Program Information
  List of Academic Programs and Curricula
  Course Descriptions
  Registration
  Student Services
  Academic Success, Advising and Tutoring Services
  Special Programs
  Index of HEGIS Codes
  Previous & PDF Bulletins