Cantor's Diagonal Argument

In course

Nulla commodo veniam elit amet minim ex irure minim in nulla in do duis aliquip. Enim amet amet aute qui excepteur voluptate esse velit tempor qui ex consectetur. Mollit dolore magna dolor reprehenderit commodo fugiat mollit veniam do. Ullamco ea in nisi irure qui. Est aliquip voluptate laborum veniam pariatur.

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

https://mediaspace.epfl.ch/media/0_zk1tlekn

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.

Ontological neighbourhood

Mathematics

Mathematical logic: Set theory

Topology: General topology

Analysis: Topics in analysis

Theoretical computer science

Algorithms and data structures: Analysis of algorithms, Data structures

Related lectures (294)