Please ensure Javascript is enabled for purposes of website accessibility

Course : Computability

L3 - Costas Dimitracopoulos

Course Description

Course

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.

Agenda

Announcements

ALL ANNOUNCEMENTS...
  • - There are no announcements -