223C. Topics in Computability Theory. 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.