Theoretical Computer Science Ws 2017

Detailed information on the material covered during the semester, including relevant references to the literature, will be regularly given here. Our two main textbooks are listed below. Both of those textbooks are available for free download via the University of Vienna Library. The book of Herbert Enderton, Computability theory. An introduction to recursion theory , gives a detailed introduction to the subject of recursion theory and will be used in the beginning of the course. The book of Sanjeev Arora and Boaz Barak, Computational complexity. A Modern Approach, gives a comprehensive account of many interesting topics in computational complexity. Another excellent source is [3].