|
Structure Tree
Lecture not found in this Term.
Lecture is in Term
WS 2009/10
, Currentterm: SoSe 2024
|
- Functions:
There exists no allocation-period.
|
|
Theoretical Computer Science
Sprache: German
application required
|
|
Nr.:
3213
Lecture
WS 2009/10
4 Hours per week in term
Every Term
|
|
Additional Links:
|
Webseite mit Videos zur Vorlesung von Prof. Ertel
|
|
Master-Studiengang:
|
Computer Science
|
|
|
| |
|
Curricula
|
Computer Science, Abschluss 90,
(
1.
Term )
- ECTS-Points : 5
- Category : mandatory subject
|
|
Responsible Instructors:
|
Ertel
,
Drotleff
|
| |
|
|
|
|
There exists no allocation-period.
|
|
|
Dates/Times/Location:
|
Friday
08:00
-
11:15
Singterm
Begin : 23.10.2009
End : 23.10.2009
|
|
Room :
K 103
Building K
|
|
|
Friday
08:00
-
11:15
weekly
Begin : 06.11.2009
End : 23.11.2009
|
|
Room :
K 103
Building K
|
|
|
Thursday
08:00
-
09:30
weekly
|
Lecturing Instructor:
Ertel
|
Room :
K 104
Building K
|
|
|
Friday
08:00
-
09:30
weekly
|
|
Room :
K 104
Building K
|
| |
| |
| Comment: |
* Formal languages and machine models
- Finite state automata and regular languages
- Push-down automata and context-independant languages
- Chomsky hierarchy
- Turing machines
* Logic
- Predicate logic (syntax, semantics, calculi, especially resolution)
* Other logics: modal logic, temporal logic, fuzzy logic
* Cmplexity and computability
- Computability
- Complexity classes and NP-completeness
- The Goedel theorems
Theoretical and practical exercises for all parts of the module will deepen students' understanding of the topics covered. |
| |
| Literature: |
D. Hoffmann: Theoretische Informatik, Hanser Verlag, 2009
W. Ertel: Grundkurs Künstliche Intelligenz, Vieweg Verlag, 2008
R. Socher. Theoretische Grundlagen der Informatik. Fachbuchverlag
Leipzig, 2003.
J. Dassow: Logik für Informatiker, 2005.
M. Garey and D. Johnson: Computers and Intractability. |
| |
| Remarks: |
The course "Theoretical Computer Science" aims to impart the theoretical foundations of formal languages, logic and computability.
Students shall get an in-depth understanding of formal languages and machine models necessary for the development of parsers and compilers. Predicate logic as an essential basis for formal procedures in program verification, hardware design and artificial intelligence will be introduced from scrap as a formal language with declarative semantics. Resolution calculus, which is important for automatic theorem proving and verifying systems, will be covered in detail.
The aim of the unit Complexity and Computability is to convey an understanding of the fact that there are functions which, in principle, a computer cannot calculate. Computable functions are analysed in more detail using the classic breakdown into complexity classes. Terms such us P, NP, decidability, halting problem, semi-decidability and recursive enumerability. |
| |
| Access requirements: |
Programming, Basics of Computer Science, Mathematics 1, 2 |
| |
| Exams accredited: |
unmarked: --- .
marked: written examination, 90 minutes.
See also "Offizielle Aushänge" |
| |
|
|
| Modules: |
Theoretical Computer Science (IN) |
LSF Online-Help
