Fall 2026

Introduction to Theory of Computing

Introduction to the theory of computing, covering finite automata, computability, and complexity theory.

offering recorded3 credits
Recorded instructors · Fall 2026 Jin-Yi Cai3.4/5

Summary

1 / 6

Workload is heavy with weekly homeworks requiring significant time, and grading can be inconsistent, with some finding tests difficult despite easy homework.

Grade history

average GPA
letter grades
A
AB
B
BC
C
D
F

All recorded terms · compare terms & instructors

Prerequisites

Course map

(MATH/​COMP SCI 240 or STAT/​COMP SCI/​MATH 475) and (COMP SCI 367 or 400), or graduate/professional standing, or declared in the Capstone Certificate in Computer Sciences for Professionals

COMPSCI 520

This is a best-effort interpretation; check the catalog requirements above.

Prerequisite text tree

Professors

Fall 2026
/5Adjusted rating
/5RMP difficulty
captured reviews
About this rating

Raw average: 3.19/5 from 31 quality ratings. The adjusted rating blends this with the UW review average (3.66/5), weighted as 20 additional ratings. Smaller samples stay closer to that average. Each captured review is counted once in the prior; this does not correct who chooses to leave a review.

For this course: 3.5/5 raw quality · 4.2/5 difficulty · 22 reviews

RMP profile ↗ · All captured review dates; profile matched by name.

Jin-Yi Cai is praised for his passion, clarity, and personable nature, with students finding his lectures approachable and helpful. Reviewers highlight his charisma and willingness to assist, noting that attending lectures provides clear guidance for assignments and exams.

Some recent reviews criticize Cai for unclear explanations, vague jargon, and rapid speech, stating that lectures are unhelpful and require self-study. These students report that exams are difficult despite easy homework grading, and one reviewer advises avoiding the course under his instruction.

Recent recorded grades — Fall 2023: 3.19 GPA, 64.1% A/AB (n=39 letter grades); Spring 2025: 2.79 GPA, 36.8% A/AB (n=57 letter grades); Spring 2026: 2.73 GPA, 32.4% A/AB (n=37 letter grades). Includes jointly taught sections.

Historical instructors & teaching patterns

Historical reviews of Deborah Joseph: Deborah Joseph's teaching style is not considered problematic, but the course material and textbook are described as vague, leading to unclear expectations. Additionally, she was reported as difficult to reach outside of class and unresponsive to emails.

DEBORAH JOSEPH is recorded teaching in Spring 2013, Fall 2013. Recorded history may be incomplete and does not establish a future schedule.

ERIC BACH is recorded teaching in Fall 2011, Fall 2017, Spring 2022. Recorded history may be incomplete and does not establish a future schedule.

JIN-YI CAI is recorded teaching in Spring 2007, Spring 2009, Spring 2010, Fall 2010, Spring 2014, Fall 2014, Spring 2015, Fall 2015, Fall 2016, Fall 2018, Spring 2019, Fall 2019, Fall 2023, Spring 2025, Spring 2026. Recorded history may be incomplete and does not establish a future schedule.

Recorded history may be incomplete and does not establish a future schedule.

Calendar & sections

Fall 2026

Schedule loads here as you scroll.

SectionModeEnrolled / capacityWaitlist
LEC 001Classroom Instruction38 / 500

Times are Central. Select a meeting for details; export includes recorded dates for the selected sections. Enrollment reflects scan time.

Meeting source records

Student experience

the class

Jin-Yi Cai is praised for his passion, clarity, and personable nature, with students finding his lectures approachable and helpful for learning.

Recent recorded grades — Fall 2023: 3.19 GPA, 64.1% A/AB (n=39 letter grades); Spring 2025: 2.79 GPA, 36.8% A/AB (n=57 letter grades); Spring 2026: 2.73 GPA, 32.4% A/AB (n=37 letter grades).

difficulty & workload

Workload is heavy with weekly homeworks requiring significant time, and grading can be inconsistent, with some finding tests difficult despite easy homework.

Some students struggle with Cai's lecturing style, citing vague jargon, poor explanations, and a need to self-teach content not covered in class.

Topics

  • Finite automata, regular languages, computability, complexity theory, context-free grammars, and cryptography.

Skills

  • Understanding the theoretical foundations of computation, including automata, computability, and complexity.

Grades

Latest available · Spring 2026— not enough history to project Fall 2026.

average GPA
A / AB grades
letter grades
Instructor

Grade distribution · % of letter grades

A
AB
B
BC
C
D
F

Grades over time

Through Spring 2026

More grade details Grade mix, volume & source data

Where this course fits relative to

Latest available grades · Spring 2026 · all course levels

GPA

Higher than % of other courses in this group.

Course GPAs · red marks this course’s range

letter grades

More recorded grades than % of other courses in this group.

Typical course in this group: letter grades.

About this comparison

1283 courses over the same term, each with at least 30 recorded letter grades. Cross-listed courses count once. GPA is not a measure of difficulty or teaching quality. The typical course is the median by recorded grade count; tied values are not counted as lower. Grade counts describe course scale, not unique students or typical section size.

Descriptions compare GPA with this group’s average: at least 0.20 higher or lower; otherwise close to average. Section size uses median recorded enrollment: small up to 30, mid-sized 31–99, large 100+. Lectures and discussion/lab sections are described separately.

Sources & history

UW–Madison

Catalog & offerings

Descriptions, prerequisites, and recorded course offerings.

Catalog observation history

Observations at scan time; dates do not imply when a catalog change took effect.

Selected offering source records
COMPSCI 520 · Fall 2026

Introduction to Theory of Computing

Recorded 2026-09-07
Raw records
[
  {
    "run_id": "20260907T155543-ce3781c4",
    "semester": "1272",
    "observed_at": "2026-09-07 15:55:43.033547+00:00",
    "offering_id": "1272:266:004271",
    "course_id": "COMPSCI 520",
    "course_uid": "course_1789820d64d4298321fc24d2",
    "term_id": "1272",
    "source_course_id": "004271",
    "source_subject_id": "266",
    "title": "Introduction to Theory of Computing",
    "credits_min": 3,
    "credits_max": 3,
    "typically_offered": "Fall, Spring"
  }
]
Rate My Professors

Student reviews

Original comments behind the course and instructor summaries.

Read original reviews
Madgrades

Grade history

Recorded grade distributions by term, section, and instructor.

Explore recorded grades
Model outputs & technical records
nvidia/Qwen3.6-35B-A3B-NVFP4
LLM outputs across runs
Full model traces

Recorded model configuration, reasoning, and tool conversations.

Model & dataset provenance
{
  "model": "nvidia/Qwen3.6-35B-A3B-NVFP4",
  "model_revision": "1355db6a052410cfd62085d94b58866fd0f2c3c5",
  "task_version": "14",
  "output_id": "31eb469a847d1425465e520ad36588c21ccc05d6b02a7c9ccc5a9e2650fb1621",
  "requirements_status": "needs_review",
  "dataset_revision": "e243353dcb7d79b7247ced91d69443ef4c2a6349",
  "observed_at": "2026-09-07 15:55:43.033547+00:00"
}