Vertiefung Theoretische Informatik

Instructor:
  • Viorica Sofronie-Stokkermans <sofronie@uni-koblenz.de>
  • Exercise
  • Slides
  • Exercise Sheets
  • Newsgroup: infko.theoinf

  • Exam: Written (duration 2 h) or oral, dependig on the number of participants.

  • The registration is open
  • Question/Answer Session: Friday, 23.02.2018, 12:00s.t.- max. 14:00, Room B 016

  • List of topics: [summary.pdf]
  • Termin 2: Friday, 6.04.2018, starting from 10:00, Room B225 (oral exam)
  • The registration is open until 3.04.2018.

  • Contents

    This lecture presents important notions and results related to computability and its limits.
  • Turing Machines and Turing Computability
  • Register machines (LOOP, WHILE, GOTO)
  • Recursive functions
  • The Church-Turing Thesis
  • Computability and (Un-)decidability
  • Complexity