## CS 103: Mathematical Foundations of Computing

What are the theoretical limits of computing power? What problems can be solved with computers? Which ones cannot? And how can we reason about the answers to these questions with mathematical certainty? This course explores the answers to these questions and serves as an introduction to discrete mathematics, computability theory, and complexity theory. At the completion of the course, students will feel comfortable writing mathematical proofs, reasoning about discrete structures, reading and writing statements in first-order logic, and working with mathematical models of computing devices. Throughout the course, students will gain exposure to some of the most exciting mathematical and philosophical ideas of the late nineteenth and twentieth centuries. Specific topics covered include formal mathematical proofwriting, propositional and first-order logic, set theory, binary relations, functions (injections, surjections, and bijections), cardinality, basic graph theory, the pigeonhole prin
more »

What are the theoretical limits of computing power? What problems can be solved with computers? Which ones cannot? And how can we reason about the answers to these questions with mathematical certainty? This course explores the answers to these questions and serves as an introduction to discrete mathematics, computability theory, and complexity theory. At the completion of the course, students will feel comfortable writing mathematical proofs, reasoning about discrete structures, reading and writing statements in first-order logic, and working with mathematical models of computing devices. Throughout the course, students will gain exposure to some of the most exciting mathematical and philosophical ideas of the late nineteenth and twentieth centuries. Specific topics covered include formal mathematical proofwriting, propositional and first-order logic, set theory, binary relations, functions (injections, surjections, and bijections), cardinality, basic graph theory, the pigeonhole principle, mathematical induction, finite automata, regular expressions, the Myhill-Nerode theorem, context-free grammars, Turing machines, decidable and recognizable languages, self-reference and undecidability, verifiers, and the P versus NP question. Students with significant proofwriting experience are encouraged to instead take
CS154. Students interested in extra practice and support with the course are encouraged to concurrently enroll in
CS103A. Prerequisite: CS106B or equivalent. CS106B may be taken concurrently with
CS103.

Terms: Aut, Win, Spr, Sum
| Units: 3-5
| UG Reqs: GER:DB-Math, WAY-FR

Instructors:
Lee, C. (PI)
;
Liu, A. (PI)
;
Schwarz, K. (PI)
;
Smith, R. (PI)
;
Varodayan, D. (PI)
;
Vitko, A. (PI)
;
Cai, B. (TA)
;
Chan, E. (TA)
;
Dudas, S. (TA)
;
Fang, F. (TA)
;
Fotedar, N. (TA)
;
Galczak, A. (TA)
;
Guo, J. (TA)
;
Hakim, D. (TA)
;
Hulett, R. (TA)
;
Li, J. (TA)
;
Li, W. (TA)
;
Melloni, J. (TA)
;
Radif, D. (TA)
;
Reamer, S. (TA)
;
Sha, H. (TA)
;
Sharp, A. (TA)
;
Smith, R. (TA)
;
Spayd, J. (TA)
;
Spyropoulos, A. (TA)
;
Srivatsan, K. (TA)
;
Wang, Q. (TA)
;
Wang, W. (TA)
;
Yau, J. (TA)
;
Zhi, Q. (TA)
;
de Leon, A. (TA)

## CS 154: Introduction to Automata and Complexity Theory

This course provides a mathematical introduction to the following questions: What is computation? Given a computational model, what problems can we hope to solve in principle with this model? Besides those solvable in principle, what problems can we hope to efficiently solve? In many cases we can give completely rigorous answers; in other cases, these questions have become major open problems in computer science and mathematics. By the end of this course, students will be able to classify computational problems in terms of their computational complexity (Is the problem regular? Not regular? Decidable? Recognizable? Neither? Solvable in P? NP-complete? PSPACE-complete?, etc.). Students will gain a deeper appreciation for some of the fundamental issues in computing that are independent of trends of technology, such as the Church-Turing Thesis and the P versus NP problem. Prerequisites:
CS 103 or 103B.

Terms: Aut
| Units: 3-4
| UG Reqs: GER:DB-EngrAppSci

Instructors:
Reingold, O. (PI)
;
Chen, A. (TA)
;
Marshall, W. (TA)
...
more instructors for CS 154 »

Filter Results: