NCSC-6002  Computability and Complexity

Note: The following provides a suggested course description, objectives, and an outline. These may be modified pending discussion with the Faculty Chairs, proposing faculty, and other curriculum reviewers.

Course Description: Addresses concepts related to theoretical limits on computational solutions to inherently complex or undecidable problems. Topics include the Church-Turing hypothesis; decidability, the halting problem; time and space complexity; intractability; NP completeness.

 


 

 




 Walden University's main offices are located at 155 Fifth Avenue South, Minneapolis, MN 55401. Telephone: 800-WALDENU(800-925-3368) or (612)338-7224. Fax: (612)338-5092. Copyright 2002-2004 Walden University