Computability and Complexity

CSCI-4050

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.

4 credits

Past Term Data

Offered
Not Offered
Offered as Cross-Listing Only
No Term Data
Spring Summer Fall
(Session 1) (Session 2)
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 8/60
2013
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 16/60
2012
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 11/60
2011
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 11/60
2010
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 12/60
2009
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 8/60
2008
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 5/60
2007
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 10/60
2006
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 9/60
2005
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 3/60
2004
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 6/20
2003
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 4/20
2002
Comput. & Complexity (4c)
  • Mark K Goldberg
Seats Taken: 4/20
2001
2000
1999
1998
Computability (4c)
  • Robert F McNaughton
Seats Taken: 60/70