ConceptTheory & Algos
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.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
6The lectures that define it or assume it, and the concepts next to it.