Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Graph
Search

Course

MATH-483: Gödel and recursivity

Summary

Gödel incompleteness theorems and mathematical foundations of computer science

Lectures

Instructors

Official source

https://edu.epfl.ch/coursebook/en/godel-and-recursivity-MATH-483

Moodle Page

http://go.epfl.ch/MATH-483

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.

Summary

Gödel incompleteness theorems and mathematical foundations of computer science

Lectures

Instructors

Official source

https://edu.epfl.ch/coursebook/en/godel-and-recursivity-MATH-483

Moodle Page

http://go.epfl.ch/MATH-483

About this result

Ontological neighbourhood

Theoretical computer science

Theory of computation: Computability theory

Logic

Classical logic: First-order logic

Related courses (30)

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 ...

MATH-381: Mathematical logic

Branche des mathématiques en lien avec le fondement des mathématiques et l'informatique théorique. Le cours est centré sur la logique du 1er ordre et l'articulation entre syntaxe et sémantique. C'est entre autres un cours dans lequel la pratique mathématiq ...

CS-550: Formal verification

We introduce formal verification as an approach for developing highly reliable systems. Formal verification finds proofs that computer systems work under all relevant scenarios. We will learn how to use formal verification tools and explain the theory and ...

MATH-318: Set theory

Set Theory as a foundational system for mathematics. ZF, ZFC and ZF with Atoms. Relative consistency of the Axiom of Choice, the Continuum Hypothesis, the reals as a countable union of countable sets, the existence of a countable family of pairs without a ...

CS-320: Computer language processing

We teach the fundamental aspects of analyzing and interpreting computer languages, including the techniques to build compilers. You will build a working compiler from an elegant functional language into machine code using a popular backend called LLVM (htt ...