Jun 13, 2024  
Graduate Catalog | 2017-2018 
    
Graduate Catalog | 2017-2018 Previous Edition

Add to Catalog Bookmarks (opens a new window)

ITCS 8175 - Computability and Complexity


Study of computability, unsolvability, computational complexity. Concept of effective computability; recursive functions; mathematical models of computation; universal Turing machines; unsolvable problems; time and space complexity of computations; NP-completeness problems; subrecursive hierarchies.

Credit Hours: (3)
Prerequisite(s): ITCS 8114 .
Most Recently Offered (Day): Course has not been offered at this time in the past 3 years
Most Recently Offered (Evening): Course has not been offered at this time in the past 3 years


Schedule of Classes




Add to Catalog Bookmarks (opens a new window)