COMP 147
Computing Theory.
University of the Pacific · UGRD · Fall 2026
1 section
Catalog description
Students study automata, formal languages and computability. Topics include finite state automata, regular languages, pushdown automata, context-free languages, Turing machines; decidability, reducibility, and time complexity that includes NP-completeness and intractability. Prerequisites: Completion of all Fundamental Skills; COMP 047 or ECPE 071 or MATH 074 with a "C-" or better.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #pacific-0636Fall 2026UGRD4 credits
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?