Charles Explorer logo
🇬🇧

Computability A

Class at Faculty of Arts |
ALG110010

Annotation

Recursive functions and sets as a mathematical definition of the notion of algorithm. Other computational models.

Recursively enumerable sets, the halting problem, arithmetical hierarchy. M-reducibility, m-completeness, creative sets, simple sets.