Jul 15, 2025  
Rensselaer Catalog 2024-2025 
    
Catalog Navigation
  Catalog Home
  Academic Calendar
  Degrees Offered
  Degree Types
  Information Directory
  Rensselaer in Brief
  Core Curriculum
  Educational Programs and Resources
  Research Resources and Centers
  Student Life
  Financial Aid
  Admissions
  Tuition and Fees
  Programs
  Academic Information and Regulations
  Schools
  Departments
  Subject Codes
  Courses
  Administration
  Named Professorships
  The Faculty
  My Portfolio
HELP
Rensselaer Catalog 2024-2025 [Archived Catalog]

Add to Portfolio (opens a new window)

CSCI 6050 - 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.

Students cannot receive credit for both CSCI 4050 and CSCI 6050.

When Offered: Fall annually

Co-Listed: CSCI 4050  

Graded: Y

Credit Hours: 3


Add to Portfolio (opens a new window)