Course

CS-251: Theory of computation

Summary

This course constitutes an introduction to theory of computation. It discusses the basic theoretical models of computing (finite automata, Turing machine), as well as, provides a solid and mathematically precise understanding of their fundamental capabilities and limitations.

Lectures

Instructor

Mika Tapani Göös

Website https://theory.epfl.ch/mika/ Teaching & PhD PhD Students Valentin Imbach, Ziyi Guan, Artur Riazanov, Anastasiia Sofronova, Weiqiang Yuan Past EPFL PhD Students Maystre Gilbert Théodore Courses Computational complexity CS-524 In computational complexity we study the computational resources needed to solve problems and understand the relation between different types of computation. This course advances the students knowledge of computational complexity, and develop an understanding o

Official source

https://edu.epfl.ch/coursebook/en/theory-of-computation-CS-251

Moodle Page

http://go.epfl.ch/CS-251

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Summary

Lectures

Instructor

Mika Tapani Göös

Official source

https://edu.epfl.ch/coursebook/en/theory-of-computation-CS-251

Moodle Page

http://go.epfl.ch/CS-251

About this result

Related courses (31)

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

EE-556: Mathematics of data: from theory to computation

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees

MATH-483: Gödel and recursivity

Gödel incompleteness theorems and mathematical foundations of computer science ...

CS-308: Introduction to quantum computation

The course introduces the paradigm of quantum computating in an axiomatic way. We introduce the notions of quantum bits, gates, and circuits. We introduce themost important quantum algorithms. We also touch upon error-correcting codes. This course is indep ...

PHYS-467: Machine learning for physicists

Machine learning and data analysis are becoming increasingly central in sciences including physics. In this course, fundamental principles and methods of machine learning will be introduced and practised. ...