Darstellung / Vorschau
Computability
(L3) - Costas Dimitracopoulos
Beschreibung des Kurses
Recursive definitions and inductive proofs. Primitive recursive functions. Recursive functions. Turing computability, the Church-Turing thesis, unsolvable problems and undecidable relations. Basic theory of recursive functions and recursively enumerable sets. Applications to Logic.
Creation Date
Dienstag, 20. Februar 2024
-
Syllabus
There is no syllabus