Proving Undecidability With Turing Reduction To LHalt

Поділитися
Вставка
  • Опубліковано 21 сер 2023
  • In this video, we prove that the language LAllReject (the set of machines that reject all inputs) is undecidable via a Turing reduction to LHalt.

КОМЕНТАРІ • 2