|
|
News
October 12 2009: The question session for all groups will be
as follows:
| TA | Date and time | Room |
| Karl Klose | Friday, October 16, 13:00 | DI-Turing-014 |
| Rikke Bendlin | Friday, October 16t, 10 | IT-house 112 |
| Rikke Bendlin | Tuesday, October 20, 10 | IT-house 131 |
| Rocio Santillan | Friday, October 16, 10:00 | 5523-129 |
| Rocio Santillan | Tuesday, October 20, 10:00 | 5523-120 |
October 6 2009: The material for week seven and information on the exam
is online. September 26 2009: The material for week six and more information on the second handin
is available now. September 18 2009: The slides and exercises for week 4 are
online. September 7 2009: The slides for the third lecture are online.
More information on the first handin is available at the
assignments page.
August 30 2009: The slides for the second lecture are online.
The slides for the first lecture are now also availabe in black/white
with one slide per page August 25 2009: To access the dBerLog newsgroup, you need a
newsreader (for example, one of the programs listed
here).
Then connect to news://news.cs.au.dk
and subscribe to the group daimi.dBerLog. It is possible that
you need to connect from the university network to get access.
August 25 2009: The slides for the first lecture are now online. -
August 20 2009: If you want to switch groups, please find a student
from the other group who is willing to take your place first.
Please use the newsgroup daimi.dBerLog on the news server
news.cs.au.dk to find other students for switching groups.
Lectures start on 26.08.09 and the first TA session will be
on 31.08.09.
July 1 2009:
Course material for the 2009 version of the course:
The books appearing below are available from Stakbogladen, Naturfag.
About this class
Contents
The course focuses on:
- universal models for computation, including Turing machines
- characterizations of computable and semi-computable
problem classes, including presentations of a number of
unsolvable problems, diagonalization, and reduction
- introduction to propositional logic, predicate logic, and
program logic, logical proof systems with applications
(program verification)
- Gödel’s completeness and incompleteness theorems
Goals
The goals of this course are to give the student the following
capabilities:
- to be familiar with the basic terminology for computability and logic
- to describe basic computability classes and fundamental logics
- to describe basic properties of computability classes and logics
- to explain constructive/algorithmic approaches to computability
classes and logics
- to analyse and to prove properties of computability classes and
logics
Lecturer
Mogens Nielsen
Examination
Oral, 12-scale; two assignments have to be answered
satisfactorily in order to attend the final oral exam.
ECTS
5 ECTS
Time and place:
Wednesday 14 - 17. Auditorium I (1514-213).
|
