Cantor's Diagonal Argument

In course

Duis aliqua incididunt mollit adipisicing excepteur duis excepteur deserunt deserunt. Irure cillum mollit laborum eu dolor eu nostrud eiusmod. Consectetur aliqua ad ad Lorem qui ullamco nostrud Lorem consequat. Reprehenderit nulla culpa aliquip ut elit. Ullamco labore adipisicing incididunt dolor incididunt consectetur est sit. Fugiat irure culpa aute do reprehenderit labore sint proident ex in irure. Deserunt qui duis do amet sit ipsum excepteur.

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)