CSC438H1

UTSG

Computability and Logic

Computable functions, Church's thesis, unsolvable problems, recursively enumerable sets. Predicate calculus, including the completeness, compactness, and Lowenheim-Skolem theorems. Formal theories and the Gödel Incompleteness Theorem. Ordinarily offered in years alternating with CSC448H1.

View full details on the UofT Academic Calendar
Prereq: CSC463H1/ CSC373H1/ CSC363H5/ CSCC63H3/ MAT247H1Breadth: Physical & Mathematical UniversesExcl: MAT309H1; PHL348H1. NOTE: Students not enrolled in the Computer Science Major or Specialist program at A&S, UTM, or UTSC, or the Data Science Specialist at A&S, are limited to a maximum of 1.5 credits in 300-/400-level CSC/ECE courses.
Easy0%
Useful0%
0
comments
0
ratings

Course Info

DepartmentCSC
CampusUTSG (St. George)
Level400
Hours24L/12T
BreadthPhysical & Mathematical Universes
What do you think of CSC438H1?

Reviews

No reviews yet — be the first to share your experience.