University of Zurich - Lecture courses/details

Fall 14Spring 18

MAT823

Introduction to Computability and Complexity Theory

$https://www.math.uzh.ch/fileadmin/user/pid_8802/bilder/24994-Bouvel.Mathilde.jpg$

Prof. Dr. Mathilde Bouvel

Lectures

Tu

Timeslot:
13:00 - 14:45

Room:
Y27H12 Seats: 50

Exercises

Online Exercise submission

Exercise Streams

This lecture offers a video stream

Downloads

Exercise sheet no. 4
Links for exercise sheet no. 1
Elements of bibliography
Turing machine and automaton simulators
Access data to the evaluation survey
Example of Turing machines and Exercise sheet no. 2
Exercise sheet no. 3
Definitions for Turing machines
Proof of NP-completeness of SAT
Homework (to be handed on November 26)
Exercise sheet no. 1
NP-hardness of IndepSet
NP-hardness of 3-SAT

Archiv

FAQ

Details

For further information please contact: Prof. Dr. Mathilde Bouvel

Exam

Exam

Module: 09.02.2016 14:00-17:00, Room: Y27H25 Seats: 50, Type: written exam