CSCI0301B-S24
Theory of Computation
Theory of Computation
This course explores the nature of computation and what it means to compute. We study important models of computation (finite automata, push-down automata, and Turing machines) and investigate their fundamental computational power. We examine various problems and try to determine the computational power needed to solve them. Topics include deterministic versus non-deterministic computation, and a theoretical basis for the study of NP-completeness. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
This course explores the nature of computation and what it means to compute. We study important models of computation (finite automata, push-down automata, and Turing machines) and investigate their fundamental computational power. We examine various problems and try to determine the computational power needed to solve them. Topics include deterministic versus non-deterministic computation, and a theoretical basis for the study of NP-completeness. (CSCI 0200 and CSCI 0201) 3 hrs. lect./disc.
- Term:
- Spring 2024
- Location:
- 75 Shannon Street 202(75SHS 202)
- Schedule:
- 2:15pm-3:30pm on Tuesday, Thursday (Feb 12, 2024 to May 13, 2024)
- Type:
- Lecture
- Course Modality:
- In-Person
- Instructors:
- Amy Briggs
- Subject:
- Computer Science
- Department:
- Computer Science
- Division:
- Natural Sciences
- Requirements Fulfilled:
- DED
- Levels:
- Undergraduate
- Availability:
- View availability, prerequisites, and other requirements.
- Course Reference Number (CRN):
- 22356
- Subject Code:
- CSCI
- Course Number:
- 0301
- Section Identifier:
- B