 Deduktive Datenbanken (4V+2Ü) (C) [B]
Mo, Mi 11-13, HS A207 (Prof. Dr. Rainer Manthey)
Übungen: Fr 9-11, HS A207 (Prof. Dr. Rainer Manthey, A. Behrend, O. Speidel)
 Grundlagen des Multimediaretrievals II (4V+2Ü) (A) [A2,B]
Mo 9-11, Mi 13-15, HS 1 (Prof. Dr. Michael Clausen, Dr. Frank Kurth)
Übungen: Di 17-19, A121 (Prof. Dr. Michael Clausen, Dr. Frank Kurth)
|
Vorlesung (Hauptstudium)
Algorithmische Komplexität und Anwendungen
Prof. Dr. Michael Clausen
Zitat von Juris Hartmanis, Gewinner des Turing Awards 1993 über das meiner Vorlesung zu Grunde liegende Buch von
Ming Li & Paul Vitányi: An Introduction to Kolmogorov Complexity and Its Applications Springer-Verlag 1997
"We are indeed in the information age and the scientific exploration of information and the laws that govern its behavior has taken center stage in the dramatic development of sciences. Kolmogorov complexity is a central concept and a powerful tool in the understanding of the quatitative nature of information and its processing and transmission. Li and Vitányi's book beautifully captures the elegance of these ideas, their relevance to most of computer science and their many theoretical as well as practical applications. The basic concepts of Kolmogorov complexity should be understood by any technically educated person, and they should be studied by all computer scientists."
(Die Vorlesung ist auf deutsch.)
| Zeit, Ort | Fr 11-13, HS 1 |
| Semesterwochenstunden | 2V |
| Beginn | 23.04.2004 |
| Bereich (alte DPO) | A |
| Bereich (neue DPO) | A1 |
|
Übersicht: alle Semester