<p>Lecture, three hours. Requisites: courses 220A, 220B. Degrees of unsolvability, recursively enumerable sets, undecidable theories; inductive definitions, admissible sets and ordinals; recursion in higher types; recursion and complexity. Topics vary from year to year. May be repeated for credit with consent of instructor. S/U or letter grading.</p>

Mathematics

Combining rigorous, inclusive pedagogy with opportunities for co-curricular activities—including research, internships, and community engagement—the College provides students with diverse learning experiences that helps them thrive, become critical thinkers, and transform society.

College of Letters and Science

The department explores the frontiers of pure and applied mathematical research.

General Catalog

Topics in Computability Theory

MATH 223C

4 units