Sign inSign in

Post correspondence problem

A toy problem used to illustrate the computation history method where given a collection of pairs of strings as dominos, one must find a sequence of them where the concatenation of the top strings equals the concatenation of the bottom strings.
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.

Concatenation1Decidability and undecidability1String1Strings and alphabets1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Connections

    6

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

    Concepts5

    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.