Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Cantor's Diagonal Argument
In course
DEMO: non elit veniam
Consectetur mollit proident deserunt ullamco commodo do ex non et aliquip. Sit quis esse culpa pariatur Lorem incididunt et nostrud culpa voluptate enim. Pariatur aliquip minim in ad esse exercitation fugiat cupidatat.
Description
This lecture covers Cantor's Diagonal Argument, demonstrating the uncountability of the set [0,1] by creating an element that cannot be listed. It also explores sequences of binary digits with infinite length and the concepts of countability and uncountability.
Official source
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.