Course page Home page Home page CoursesNew course

Decidability and reducibility: Mathematical Logic course | Zoonk

28. Decidability and reducibility

Covers decidable, recognizable, and noncomputable problems together with mapping and Turing reductions. Learners prove undecidability using diagonalization and reductions from the halting problem.

Mathematical Logic

Create this chapter

This chapter is part of the course, but it hasn't been created yet. Create it to see all of its lessons.

Create chapterNBack to courseEsc