Sign inSign in

Turing-unrecognizability proof template

To prove B is Turing-unrecognizable, show that a known Turing-unrecognizable language A is mapping reducible to B.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Mapping reducibility1Turing-unrecognizability1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.