CS 611 Advanced Computer Theory
Proofs (deductive and inductive reasoning), computability (models of computability and computability issues), and complexity (time and space bounds, nondeterminism, and complexity classification).
| Credits: | 3 |
|---|---|
| Prerequisites: | CS 252, CS 312 |
| Offerings for Fall 2009 | |||||
|---|---|---|---|---|---|
| Sec | Instructor | Description | Room Number | Time | Website |
| 1 | Jones, Michael | Advanced computer theory. | 133 TMCB | 3:00-4:15p TTh | https://cswiki.cs.byu.edu/jones/cs611 |
| 2010 | 2011 | 2012 | 2013 | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall | Win | Spr | Sum | Fall |
 |
|
|
 |
|
|
|
|
|
|
|
|
|
|
|
|
Note: Course websites may not be maintained for previous semesters.
| Offerings from the past year | |||||
|---|---|---|---|---|---|
| Semester | Instructor | Website | |||
| Fall 2008 | Jones, Michael | http://cswiki.cs.byu.edu/jones/cs611/ | |||