Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
CSCI 0401 - Computational Complexity |
*Computational Complexity*
We will investigate the computational power of various resources. Examples include determining whether a computer with limited time or limited space can solve more difficult problems, attempting to characterize creativity as a resource, and comparing probabilistic and quantum computation. We will learn why we do not yet have answers to many of the most fundamental questions in computational complexity (like whether P=NP), and we will think critically about the value of studying these topics. Students enrolled in the College Writing (CW) section of the course will explore these ideas through writing, in particular, in three contexts that are critical for theoretical computer science: the proof (expert audience), the review paper (non-expert computer science audience), and the popular science article (educated public audience). (CSCI 0301).3 hrs. sem./1 hr. disc.
0.000 OR 1.000 Credit hours 0.000 OR 1.000 Lecture hours 0.000 TO 2.000 Other hours Levels: Undergraduate Schedule Types: Discussion, Lab, Seminar All Sections for this Course Natural Sciences Division Computer Science Department Course Attributes: CW, DED |