Vertiefung Theoretische Informatik

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

  • Summary of topics: [summary.pdf]

    Hauptklausur

  • Written exam, duration 2 h.
  • Fri., 14.02.2013, 10:30-12:30, Room M 001

  • Question/Answer Session: Wednesday, 12.02.2014, 14:00, Room B 225.
  • If you cannot come on Wednesday, 12.02.2014, you have the possibility to
    ask questions on Tuesday, 11.02.2014, 14:00, Room B 225.

    It is recommended to send your questions by e-mail (to sofronie@uni-koblenz.de) before the meeting.

  • Klausureinsicht: 13.03.2014, 10:00 s.t., B 226
    • Nachklausur
  • Written exam, duration 2 h.
  • Thu., 10.04.2014, 13:30-15:30, Room M 001

  • Question/Answer Session: Wednesday, 09.04.2014, 15:00, Room B 225.

    • 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
  • If time remains: other computation models (e.g. automata over infinite words)