Computation Theory (CS-0170)

Fall 2024 · CS 0170 · Tufts University · 3 credits · Undergraduate

Models of computation: Turing machines, pushdown automata, and finite automata. Grammars and formal languages, including context-free languages and regular sets. Important problems, including the halting problem and language equivalence theorems.

Course codes: CS-0170, CS 0170, CS0170, CS-170, CS 170, CS170, MATH-0191, MATH 0191, MATH0191, MATH-191, MATH 191, MATH191

M1-LEC (Lecture) — Andrew Winslow
01-LEC (Lecture) — Megumi Ando
RA-RCT (Recitation) — Megumi Ando
RB-RCT (Recitation) — Megumi Ando
RC-RCT (Recitation) — Megumi Ando
RD-RCT (Recitation) — Megumi Ando
RE-RCT (Recitation) — Megumi Ando

aSIStant

Filters

Semester

Filters

Subject

Exclude selected subjects

Course Number

Exclude matching numbers

Course Name

Exclude matching names

Description

Exclude matching descriptions

Instructor

Exclude matching instructors

Attributes

Exclude selected attributes

Enrollment Status

OpenWaitlistClosedUnknown

Exclude selected statuses

Credits

Meeting Days

MTUWTHF

Exclude selected days

Meeting Time

to

Instruction Mode

In-PersonHybridOnline

Exclude selected modes

Career

Grading Type

Consent Required

Discord