Nov 17, 2025  
Rensselaer Catalog 2008-2009 
    
Catalog Navigation
  Catalog Home
  Degrees Offered
  Academic Calendar
  Information Directory
  Rensselaer in Brief
  Educational Programs and Resources
  Research Resources and Centers
  Student Life
  Admissions
  Financial Aid
  Tuition and Fees
  Academic Information and Regulations
  Interdisciplinary Studies
  Schools & Departments
  Schools
  Departments
  Programs
  Subject Codes
  Courses
  Administration
  Named Professorships
  The Faculty
HELP
Rensselaer Catalog 2008-2009 [Archived Catalog]

CSCI 4050 - Computability and Complexity

This course discusses concepts of languages defined by formal grammars, Turing machines and rewriting systems, computability, Church-Turing thesis, decidable and undecidable problems, computational complexity, polynomial reducibility, NP-completeness, and Cook’s theorem.

Prerequisites/Corequisites: Prerequisite: CSCI 2400.

When Offered: Fall term annually.



Credit Hours: 4