[ Lehrveranstaltungen 185/2 ]     [ AG Theoretische Informatik und Logik ]     [ Fachbereich Informatik ]     [ Technische Universitšt Wien ]

2.0 VU Theorie der Berechenbarkeit (185.203, SS 2009)

Lehrveranstaltungsleiterin: Alexander Leitsch

Computability theory is that part of theoretical computer science dealing with which problems are solvable by algorithms.

Not all problems can be solved. An undecidable problem is one that cannot be solved by any algorithm, even given unbounded time and memory. Many undecidable problems are known. The most well-known is the halting problem: given a program and inputs for it, decide whether it will run forever or will eventually halt.


Reference Books: (parts of)

Time and Place:

Monday, 12:00 - 16:00
dates: April 4, April 11, May 2, May 9, May 16, May 23
Seminar Room Gödel, Favoritenstrasse 9, ground floor
begin: April 4, 2010.