(arxiv.org)

136 points denvaar | 2 comments | 17 Nov 24 05:51 UTC | HN request time: 0.001s | source

1. whatshisface ◴[20 Nov 24 02:21 UTC] No.42190265[source]▶

That's reminicient of the post correspondence problem. Is the PCP still undecidable for sets of three strings?

replies(1): >>42191444 #

2. petters ◴[20 Nov 24 07:10 UTC] No.42191444[source]▶

I don't think that is known. But the limit is low, something like five

Tiling with Three Polygons Is Undecidable