# Theory of Computer Science

## Computer Science 383

##### Usual Description

This is a course on models of computation and the limits of computability. The first part of the course discusses mathematical models of computation and the problems that can be solved by each model. The second part of the course discusses problems that cannot be solved by any algorithmic process.

##### Course Listings

These are all of the listings of this course recorded in the Oberlin course catalog since the fall of 2007.

Listing | Semester | Professor | |
---|---|---|---|

Computer Science 383 | Taught by Robert Geitz | ||

Computer Science 383 | Taught by Alexa Sharp | ||

Computer Science 383 | Taught by Alexa Sharp | ||

Computer Science 383 | Taught by Tom Wexler | ||

Computer Science 383 | Taught by Tom Wexler | ||

Computer Science 383 | Taught by Alexa Sharp | ||

Computer Science 383 | Taught by Tom Wexler | ||

Computer Science 383 | Taught by Alexa Sharp | ||

Computer Science 383 | Taught by Alexa Sharp |