Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino...

106
Undecidability of the Domino Problem E. Jeandel and P. Vanier Loria (Nancy), LACL (Créteil), France November 20-24 E. Jeandel and P. Vanier, Undecidability of the Domino Problem 1/86

Transcript of Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino...

Page 1: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Undecidability of the Domino Problem

E. Jeandel and P. Vanier

Loria (Nancy), LACL (Créteil), France

November 20-24

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 1/86

Page 2: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The theorem (again)

Theorem (Berger 1964 (PhD), 1966 (Memoirs of the AMS))There is no algorithm that decides, given a tileset τ , if τ tiles the plane.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 2/86

Page 3: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Last time

Algorithms can be represented by Turing machinesTuring machines can be encoded into tilings

However, the encoding has a default: it needs a “catalyst” tile to launchthe computation.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 3/86

Page 4: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Proof of the Undecidability of the Domino Problem

Proofs fall into 4 categories:Berger (64)-Robinson (71) constructionsAanderaa-Lewis (74)Kari (07)Durand-Romashchenko-Shen (08)

Many, many variants of Berger-Robinson.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 4/86

Page 5: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Proof of the Undecidability of the Domino Problem

Two different ways to solve the caveat we saw on tuesday:

Force the catalyst tile to appear(Berger,Robinson,Aanderaa-Lewis,DRS)Use a different encoding of Turing machines (Kari)

We will present here the two methods

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 5/86

Page 6: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Proof of the Undecidability of the Domino Problem

Remark

Everything I’m presenting now is very well knownThe lecture notes have a third proof (Aanderaa-Lewis) which isalmost completely unknown

If you know everything about Kari and Robinson, read the lecturenotes!

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 6/86

Page 7: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Plan

1 Berger-Robinson

2 The Kari constructionEncoding of TM

3 Conclusion

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 7/86

Page 8: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Historical Notes

Inspired by the proof of Berger and Robinson, using ideas ofOllinger for simplificationRobinson’s proof is not that different from Berger

Berger has an aperiodic set of 103 tiles in his PhD

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 8/86

Page 9: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The Catalyst tile

We want to force a specific tile to appear so that it can kickstart thecomputation

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 9/86

Page 10: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Reminder

A tileset τ tiles the plane iff it tiles arbitrarily large squares

CorollaryIf every tiling of the plane contains a tile t , then there exists n s.t. tappears in every n × n square

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 10/86

Page 11: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The Catalyst tile

The specific tile t should appear everywhere.

There should be infinitely many computations in one tiling of the plane.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 11/86

Page 12: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How to do it

To obtain the Undecidability of the Domino Problem:

Find an aperiodic tileset τLook at occurrences of a specific tile t inside this τBuild computations around this tile, hoping that they do not overlap

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 12/86

Page 13: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How to do it

How do you obtain an aperiodic tileset ?

Robinson-Berger: Use substitution-like tilings.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 13/86

Page 14: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Substitutions

DefinitionA substitution is a map φ from A to An×n for some n.Given a substitution φ and an initial pattern w , we can iterate φ on w toobtain arbitrarily large patterns.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 14/86

Page 15: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 15/86

Page 16: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 15/86

Page 17: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 15/86

Page 18: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 15/86

Page 19: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 15/86

Page 20: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 15/86

Page 21: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 16/86

Page 22: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 16/86

Page 23: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 16/86

Page 24: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 16/86

Page 25: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 16/86

Page 26: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Example

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 16/86

Page 27: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Substitutive tilesets

DefinitionThe subshift Sφ associated to φ is the set of colorings of the plane thatlook like φk (w) for some large value of k .

(Of course not an exact definition)

DefinitionA tileset τ is substitutive if tilings by τ look like Sφ up to recoloring.

A lot of different substitutive tilesets in the literature. But how can youobtain them ?

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 17/86

Page 28: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Intrinsically substitutive tileset

DefinitionA tileset τ is intrinsically substitutive if the substitution φ is defineddirectly on the tiles of τ , and encoded directly into the local constraintsof τ .

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 18/86

Page 29: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Intrinsically substitutive tileset

What do we mean exactly ?φ(w) is a valid tiling iff w is a valid tiling

There is a one-to-one correspondence between the colors on the eastside of τ and colors on the east side of φ(τ).

We can desubstitute: For every tiling x by τ , there exists y s.tφ(y) = x

All? tilings of a 2× 2 square are of the form φ(t) for t ∈ τ

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86

Page 30: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Intrinsically substitutive tileset

Theorem (Durand-Levin-Shen 2004, Ollinger 2008)There is an intrinsically substitutive tileset

These are the first proven examples. However Berger’s set of 103 tilesIS intrinsically substitutive, and Robinson’s set ISN’T.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 20/86

Page 31: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The tileset of Ollinger

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 21/86

Page 32: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

A tiling

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 22/86

Page 33: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How does it work

= + +

= + +

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 23/86

Page 34: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

First layer

The first layer forces tiles to be grouped into 2× 2 squares.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 24/86

Page 35: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Second layer

(16 different tiles)

(4 different tiles)

The second layer is the image of the first layer by the substitution(more on this later)

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 25/86

Page 36: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The third layer

The third layer codes the “chair substitution”.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 26/86

Page 37: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Substitution

φ is a 2× 2 substitution. When substituting, the original tile is “found”on the bottom-left of the 2× 2 square.

Layer 1 of w is encoded into layer 2 of φ(w)

Layer 2 and 3 of w are enlarged into φ(w)

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 27/86

Page 38: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Layer 0→ Layer 1

Every φ(w) is of the form:

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 28/86

Page 39: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Layer 1→ Layer 2

Layer 1 is enlarged into Layer 2

7→ 7→

7→ 7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 29/86

Page 40: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Layer 2→ Layer 2

Layer 2 is propagated into the adjacent tiles

7→ 7→

7→ 7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 30/86

Page 41: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Layer 3→ Layer 3

Layer 3 is also propagated

7→ 7→

7→ 7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 31/86

Page 42: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Two examples

7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 32/86

Page 43: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Two examples

7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 32/86

Page 44: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Two examples

7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 32/86

Page 45: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Two examples

7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 32/86

Page 46: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Two examples

7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 32/86

Page 47: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Two examples

7→

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 32/86

Page 48: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Theorem

Theorem (Ollinger 2008)The tileset τ is intrinsically substitutive

Proof: Just? inspect all 2× 2 patterns.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 33/86

Page 49: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 34/86

Page 50: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Theorem

The fact the tileset is substitutive proves it is aperiodic but does notexplain everything

Why do we need the third layer ?

What are the rules between the layers ?

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 35/86

Page 51: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The substitution again

Every φ(w) is of the form:

7→ A H

V C

A: any tileC: corner tileH: horizontal tile: propagate signal from A horizontallyV : vertical tile: propagate signal from A vertically

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 36/86

Page 52: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The substitution again

What if we have something of the form

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 37/86

Page 53: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The substitution again

What if we have something of the form

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 37/86

Page 54: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The substitution again

What if we have something of the form

7→

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 37/86

Page 55: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The substitution again

What if we have something of the form

7→H

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 37/86

Page 56: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The substitution again

What if we have something of the form

7→H

The corner at the top right of the square determines what kind of tileswe can put at the bottom left of the square

That’s what the third layer is ensuring.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 37/86

Page 57: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

More details

7→ A H

V C

What color appear on the blue part determines which corner is in C.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 38/86

Page 58: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Rules for V

Here are the possible rules for the tile at the top left (tile of type V ):

Similar rules for the tile at the bottom right.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 39/86

Page 59: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Theorem

Theorem (Ollinger 2008)The tileset τ is instrinsically substitutive, and we more or lessunderstand why.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 40/86

Page 60: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

What do we do now ?

We will encode computations inside the tilings s.t. there is a tiling iffsome Turing Machine does not halt.

First, we simplify the tilings by looking only at the red color at layer 2

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 41/86

Page 61: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 42/86

Page 62: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 43/86

Page 63: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

What we have

We obtain squares in which we could put a Turing machine

Squares have a designated corner in which we could put the catalytictile.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 44/86

Page 64: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Problem

Squares intersect

Solution: Keep only half the squares.Technically: two different shades of red (dark/light), dark red can onlycross light red.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 45/86

Page 65: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 46/86

Page 66: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Problem

Squares inside squares.

We cannot change this

Technical trick due to Robinson: Use on bigger square only the spacethat is not hindered by the smaller squares.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 47/86

Page 67: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 48/86

Page 68: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

What to do now

We now put our Turing machine in the space left blankIt will be initialized by the bottom left corner of a square, which isalways free (blank)The free (blank) space inside a square is not connected, howeverwe can use the gray cells to transmit information(colors) betweentwo blank cells on the same row/columnLot of technical details.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 49/86

Page 69: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Idea

Suppose there is a tiling of the planeThen there are tilings of arbitrarily large red squaresThese squares contains computation of the Turing machine for anarbitrarily long timeTherefore the Turing machine does not halt

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 50/86

Page 70: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Idea

Suppose the TM does not haltBuild a tiling of the plane by putting in each red square thebeginning of the computation of the TM.

Therefore there exists a tiling iff the TM does not halt.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 51/86

Page 71: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Remarks

Essentially Robinson’s proofRobinson is not substitutive. Ollinger is a cover of Robinson that isintrinsically substitutive.

Berger’s proof builds infinite vertical strips rather than squaresThe vertical strips overlap, so same trick is used

Berger’s set of 104 103 tiles is almost the same asRobinson/Ollinger !

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 52/86

Page 72: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Plan

1 Berger-Robinson

2 The Kari constructionEncoding of TM

3 Conclusion

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 53/86

Page 73: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Kari construction

Main idea :

Use a different encoding of Turing machines into tilings that do nothave the problems we encountered

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 54/86

Page 74: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Problems (from last time)

Erratic configurations:

tilings with no head per rowtilings with more than one head per rowtilings may no start from the initial statetilings using only the blank tile

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 55/86

Page 75: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

New encoding

This new encoding (to be defined) forces that there is exactly one headper row.

Which problem remains ?

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 56/86

Page 76: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The Immortality Problem

Theorem (Hooper 1966)There is no algorithm that decides, given a Turing machine, if thereexists SOME configuration on which it runs forever.

Configuration can be arbitrarily (arbitrarily initial state, arbitrarily initialfilling of the tape)

New encoding + Hooper Theorem = WIN

Note: Proof of Hooper’s Theorem is very hard.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 57/86

Page 77: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Kari’s idea

Two steps:

It is very easy to simulate affine maps with tilesets

A Turing Machine can be encoded into piecewise affine maps.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 58/86

Page 78: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How to encode Turing machines

A Turing Machine can be encoded into piecewise affine maps.

Idea: use the moving tape model.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 59/86

Page 79: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Idea

Suppose the states and symbols of the Turing machine are integers.

1 2 0 1 2 2 0 1 0 3 2

1

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 60/86

Page 80: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Idea

Suppose the states and symbols of the Turing machine are integers.

1 2 0 1 2 2 0 1 0 3 2

1

Code it into:L = 0.021 . . .R = 0.12201032 . . .S = 1

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 60/86

Page 81: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Encoding

Every configuration of the Turing machine will be encoded into a tuple(L,R,S) ∈ R3, representing the left part, the right part, and the state ofthe configuration.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 61/86

Page 82: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How does it work

The TM is in state q and reads an x is the same as

S ∈ [q,q + 1[ and R ∈ [x/10, x/10 + 0.1[

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 62/86

Page 83: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How does it work

We replace the x by a y is the same as

R ← R + (y − x)/10

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 63/86

Page 84: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How does it work

We move the head to the right is the same as

L← (L + x)/10

R ← 10(R − x/10)

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 64/86

Page 85: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

How does it work

If we are in state q and read x , we output y , change to state q′ and wemove to the right:

f (L,R,S) = ((L + y)/10,10(R − x/10),q′)

if S ∈ [q,q + 1[ and R ∈ [x/10, x/10 + 0.1[

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 65/86

Page 86: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Result

A Turing machine is essentially the same as a piecewise affine map

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 66/86

Page 87: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Caveats

The base in which we represent the tape should be strictly biggerthan the alphabet.

To avoid 0.099999 · · · = 0.100000 . . .

Some inputs of the piecewise affine map do not correspond to“real” tapes

This is usually not a problem

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 67/86

Page 88: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Result

Theorem (Hooper 1966)There is no algorithm that decides, given a Turing machine, if thereexists SOME configuration on which it runs forever.

TheoremThere is no algorithm that decides, given a 3D piecewise affine map f ,if there exists x s.t f n(x) is defined for all n.

Now it remains to..

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 68/86

Page 89: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Kari’s idea

It is very easy to simulate affine maps with tilesets

(if they have rational coefficients)

We will only explain how to simulate a map f : x → ax + b. Addinglinear constraints (x < c) or going to higher dimensions is easy.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 69/86

Page 90: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Idea

One row of colors will represent a real number x .

One row of a tiling represents transitions between two rows of color(the colors at the south, and the colors at the north)

We will design the tileset so that one row of the tiling will represent theoperation x → f (x).

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 70/86

Page 91: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Question

How do we represent real numbers as biinfinite sequences ?

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 71/86

Page 92: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

The β-sequence

DefinitionThe β-sequence for a number x is the biinfinite sequence

βn(x) = bnxc − b(n − 1)xc

Examples:β(0) = . . . 000000000000000000000000 . . . .β(1/2) = . . . 010101010101010101010101 . . . .β(1/3) = . . . 100100100100100100100100 . . . .β(√

2− 1) = . . . 001010010100101010010100 . . . .

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 72/86

Page 93: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Properties of β-sequences

βn(x) ∈ {bxc, bx + 1c}n consecutive bits of β(x) gives a good approximation of x :∑k+n

i=k+1 βi(x)n

=b(k + n)xc − bkxc

n∈ [x − 1

n, x +

1n]

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 73/86

Page 94: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Backwards

We have obtained a map from real numbers to biinfinite sequences of0 and 1.

We need a reverse map, for example:

r(w) = lim infn→+∞

∑ni=−n wi

2n + 1

Notice that r(β(x)) = x .

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 74/86

Page 95: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Main theorem

TheoremFor every q ∈ Q there exists a tileset τ s.t.

For every x, there exists a tiling of a row with β(x) at the bottomand β(qx) at the topIn a tiling of a row by τ , we have r(t) = qr(b) where t and bdenote the colors on the top and bottom of the row.

First item: The tileset simulates multiplication by q if fed the right input.Second item: It also simulates multiplication by q on bad inputs.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 75/86

Page 96: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Idea of the proof

The tileset τ consists of all tiles of the form

c c′b

a

with c, c′ ∈ [−q,1] andqa + c = b + c′

Ideally we would like qa = b. c represents a carry from the past, and c′

a carry we will give to our future.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 76/86

Page 97: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

First point

This works if we have β(x) on bottom and β(qx) on top

qb(n − 1)xc − bq(n − 1)xc qbnxc − bqnxc

βn(qx)

βn(x)

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 77/86

Page 98: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Second point

Suppose we have t on top and b at bottom.Then

qn∑

i=−n

bi + c−n =n∑

i=−n

ti + cn

Thereforeq∑n

i=−n bi

2n + 1=

∑ni=−n ti

2n + 1+

cn − c−n

2n + 1And

qr(b) = r(t)

as cn − c−n = O(1)

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 78/86

Page 99: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Slight problem

Note: we need a finite tileset

We only need carries that can occur on the β-sequences. If q = n/mwe only need carries in [−q,1] that are rational fractions of m, andthere are finitely many of them.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 79/86

Page 100: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Main theorem

TheoremFor every piecewise affine map f with rational coefficients, there existsa tileset τ s.t.

For every x, there exists a tiling of a row with β(x) at the bottomand β(f (x)) at the topIn a tiling of a row by τ , we have r(t) = f (r(b)) where t and bdenote the colors on the top and bottom of the row.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 80/86

Page 101: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

End of the proof

Let f be a piecewise affine map.

Suppose there exist n s.t. f n(x) is defined for all n.

Then there exists a tiling of a half plane with β(f n(x)) as the bottomcolor of the n-th row

(By the first point)

Therefore there exists a tiling of the plane by compactness

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 81/86

Page 102: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

End of the proof

Let f be a piecewise affine map.

Suppose there exist a tiling of the plane

Let bn be the color at the bottom of the n-th row.

Then r(bn) = f (r(bn−1)) and therefore r(bn) = f n(x) for x = r(b0)

(By the second point)

Therefore f n(x) is defined for all n.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 82/86

Page 103: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

End of the proof

There is a tiling of the plane by τ iff there exists x s.t. f n(x) is definedfor all n.

No algorithm can solve the latter problem, therefore no algorithm cansolve the former.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 83/86

Page 104: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Final remark

The proof is considerably simpler, but we have to admit the theorem ofHooper.

Somehow, the difficulty has been shifted into the proof of thetheorem of HooperThe proof of Hooper’s theorem uses tricks similar to Robinson (inparticular substitutions)

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 84/86

Page 105: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Plan

1 Berger-Robinson

2 The Kari constructionEncoding of TM

3 Conclusion

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 85/86

Page 106: Undecidability of the Domino Problem · E. Jeandel and P. Vanier, Undecidability of the Domino Problem 19/86. Intrinsically substitutive tileset Theorem (Durand-Levin-Shen 2004, Ollinger

Conclusion

Two different proofs of the Undecidability of the Domino Problem

One more proof in the lecture notesOne last proof will be given in the full version of the lecture notes.

E. Jeandel and P. Vanier, Undecidability of the Domino Problem 86/86