top | item 42162271

Tiling with Three Polygons Is Undecidable

136 points| denvaar | 1 year ago |arxiv.org

27 comments

order
[+] xianshou|1 year ago|reply
First you ask how the hell someone could come up with this construction.

Then you realize it was this guy: https://en.wikipedia.org/wiki/Erik_Demaine

[+] atq2119|1 year ago|reply
And then you read the abstract and realize that this is an improvement of an earlier result using five polygons (which in turn built on a history of earlier results).

So, still a great result, but not as out there as one may think.

I think it's also worth pointing out that in theoretical CS and most of math, it is common to list authors alphabetically. I don't think we have a way of knowing the relative contribution of the two authors. Demaine is obviously accomplished, but I find the kind of hero worship found in this thread distasteful and the facts don't support it here. Give credit to Langerman; Demaine surely would!

[+] _Donny|1 year ago|reply
Woah! It is the same guy that got me through my algorithms course at university with his youtube MIT OpenCourseWare videos!

His lectures are absolute gold. He explains everything so clearly, simply, and efficiently.

I started skipping lectures in favor of watching his videos, and it saved me countless of hours -- and I got a perfect mark :)

[+] heavensteeth|1 year ago|reply
>former child prodigy

I understand the idea behind that phrasing but I'm not sure I agree with it. Are you no longer a child prodigy once you turn 18? I don't think I'd ever say "former intelligent child".. Would I?

[+] YoumuChan|1 year ago|reply
The author gave a talk on this at Tufts during the FWCG last week. Fascinating talk.

One interesting question from audience was whether the ratio between the largest polygon piece and the smallest piece can be made bounded, as the current construction has unbounded ratio.

[+] whatshisface|1 year ago|reply
That's reminicient of the post correspondence problem. Is the PCP still undecidable for sets of three strings?
[+] petters|1 year ago|reply
I don't think that is known. But the limit is low, something like five
[+] joebergeron|1 year ago|reply
I read the title of this paper and thought to myself, “What are the chances this could be Erik Demaine?”. And sure enough!
[+] bryan0|1 year ago|reply
While not proven, is the intuition that this will also be undecideable for 1 and 2 polygon tilings?
[+] romwell|1 year ago|reply
Erik Demaine always has some fun stuff for us.