{ "cells": [ { "cell_type": "markdown", "metadata": {}, "source": [ "# Week 10: Reducibility" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "## Tuesday\n", "\n", "Last time, we started to use the undecidability of $A_{\\textsf{TM}}$ to prove the undecidability of other languages, starting with the halting problem. Today, we generalize this approach to more languages." ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "### Undecidable problems about programs\n", "\n", "
Read Theorems 5.2–4 and their proofs (pages 217–220).
\n", " \n", "Read the subsection \"Reductions via Computation Histories\" up to Theorem 5.9 and its proof.
\n", " \n", "Read the rest of Section 5.1 (pages 223–226).
\n", "Read Section 5.2.
\n", " \n", "