|
Nov 27, 2024
|
|
|
|
CIS 870 - Theory of ComputabilityCredits: 3
Formal models for computability; universal programs; Church’s thesis; unsolvable problems and reducibilities; partial recursive functions; recursive and recursively enumerable sets; s-m-n theorem and the recursion theorem.
Requisites: Prerequisite: CIS 770.
KSIS Course Search
Add to Portfolio (opens a new window)
|
|