CSE 105. Theory of Computability (4 units)
Link to catalog page: https://catalog.ucsd.edu/courses/CSE.html#cse105
Description
An introduction to the mathematical theory of computability. Formal languages. Finite automata and regular expressions. Push-down automata and context-free languages. Computable or recursive functions: Turing machines, the halting problem. Undecidability. Prerequisites: CSE 12 and CSE 15L and CSE 20 or MATH 109 or MATH 15A or MATH 31CH and CSE 21 or MATH 100A or MATH 103A or MATH 154 or MATH 158 or MATH 184 or MATH 188. Graduate students will be allowed as space permits.
Prerequisite courses
Loading...
Successor courses
CSE 105 is a prerequisite of the following 4 courses: