Diagonalization

References anf Further Reading

Textbooks

  1. Sipser, Michael. "Introduction to the Theory of Computation", 3rd Edition, Cengage Learning, 2012.

    • Chapter 1: Regular Languages
    • Chapter 4: Decidability
    • Section 4.2: Uncountability
  2. Rosen, Kenneth H. "Discrete Mathematics and Its Applications", 8th Edition, McGraw-Hill Education, 2019.

    • Chapter 2.5: Cardinality of Sets
    • Chapter 9.1: Relations and Their Properties
    • Chapter 9.2: n-ary Relations and Their Applications
  3. Enderton, Herbert B. "Elements of Set Theory", Academic Press, 1977.

    • Chapter 6: Cardinal Numbers
    • Section 6.4: Countable Sets
    • Section 6.5: The Continuum

Online Resources

Video Lectures

  1. MIT OpenCourseWare. "6.042J Mathematics for Computer Science"

  2. NPTEL. "Discrete Mathematics"

Interactive Learning

  1. Brilliant.org

  2. Khan Academy

Tutorial Websites

  1. GeeksforGeeks

  2. Stanford Encyclopedia of Philosophy

Research Papers

  1. Cantor, Georg. "Über eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen" (On a Property of the Collection of All Real Algebraic Numbers), 1874.

    • Historical paper introducing the diagonalization argument
    • Available in English translation in: Ewald, William B. (ed.) "From Kant to Hilbert: A Source Book in the Foundations of Mathematics"
  2. Turing, Alan M. "On Computable Numbers, with an Application to the Entscheidungsproblem", Proceedings of the London Mathematical Society, 1936.

Additional Learning Materials

  1. Wolfram MathWorld

  2. Cut-the-Knot

  3. American Mathematical Society