00:00:00 / 00:00:00
2 5

The undecidability of the domino problem

By Emmanuel Jeandel

Also appears in collection : Ecoles de recherche

One of the most fundamental problem in tiling theory is to decide, given a surface, a set of tiles and a tiling rule, whether there exist a way to tile the surface using the set of tiles and following the rules. As proven by Berger in the 60’s, this problem is undecidable in general. When formulated in terms of tilings of the discrete plane by unit tiles with colored constraints, this is called the Domino Problem and was introduced by Wang in an effort to solve satisfaction problems for ??? formulas by translating the problem into a geometric problem. In this course, we will give a brief description of the problem and to the meaning of the word “undecidable”, and then give two different proofs of the result.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.19248603
  • Cite this video Jeandel, Emmanuel (21/11/2017). The undecidability of the domino problem. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.19248603
  • URL https://dx.doi.org/10.24350/CIRM.V.19248603

Bibliography

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback