703796 Computability Theory
winter semester 2017/2018 | Last update: 06.03.2018 | Place course on memo list703796
Computability Theory
VO 3
6
weekly
every 2nd year
English
Students who have completed this course will have a thorough understanding of computability theory. They are prepared to prove Turing-completeness of models of computation.
The course will cover different models of computation:
- recursive function theory
- lambda calculus
- combinatory logic
- LOOP/WHILE programs
- term rewrite systems
Lecture, assessment is based on a single examination at the end of the course.
written exam
course notes will be made available from the accompanying web site
none
The course is taught in English.
see dates
- Faculty of Mathematics, Computer Science and Physics
|
Group 0
|
||||
|---|---|---|---|---|
| Date | Time | Location | ||
|
Mon 2017-10-02
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-10-09
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-10-16
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-10-23
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-10-30
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-11-06
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-11-13
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-11-20
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-11-27
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-12-04
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2017-12-11
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2018-01-08
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2018-01-15
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2018-01-22
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Mon 2018-01-29
|
15.15 - 18.00 | 3W03 3W03 | Barrier-free | |
|
Fri 2018-03-09
|
08.00 - 12.00 | HS 11 HS 11 | Barrier-free | 1st exam |