Mathematics for Informatics (UE 801B)

This is a course on the theoretical fundations of computer science. We will investigate the notion of computability and then discuss also theoretical complexity.

Lecturers

Carlos Areces and Patrick Blackburn
(based on a course prepared by Santiago Figueira)
Office B 230, LORIA, Campus scientifique de Vandoeuvre
Email: firstname.lastname@loria.fr

Slides

Additonal Exercises

Exercises

Bibliography

Computability and Logic, G. Boolos, J. Burgess and R. Jeffrey. Cambdridge Press.
Computers and Intractability, M. Garey and D. Johnson. Freeman Press.
Introduction to Combinators and Lambda-Calculus, J. Hindley and J. Seldin. Cambridge University Press

© 2004 Maintenu par Carlos Areces. Dernier mis � jour : 07-01-2008.