Dec 15, 2025  
Rensselaer Catalog 2016-2017 
    
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 2016-2017 [Archived Catalog]

CSCI 6050 - Computability and Complexity

This course discusses modern concepts of computability and computational complexity theories. The Church-Turing thesis; variations of Turing Machines; Algorithms; Decidability; The Halting Problem; Reducibility; The Recursion Theorem; The Concept of Information; Time and Space Complexity; Intractability; NP-completeness and Cook’s theorem. Students cannot receive credit for both CSCI 4050 and CSCI 6050.

Prerequisites/Corequisites: Prerequisite: CSCI 2300 or equivalent.

When Offered: Fall term annually.



Cross Listed: CSCI 4050.

Credit Hours: 3