Timeline for Tileability and computabilty
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 10, 2018 at 15:30 | history | edited | Dominic van der Zypen | CC BY-SA 4.0 |
added 8 characters in body
|
| Mar 26, 2018 at 13:27 | comment | added | Dominic van der Zypen | Thanks for your comments and questions for clarifications -> I did mean translations and rotations, no axial symmetries. | |
| Mar 26, 2018 at 10:35 | comment | added | Joseph O'Rourke | Whether or not a particular single polygon can tile the plane---a monohedral tiling---is not known to be undecidable. See "Is it decidable to determine if a given shape can tile the plane?." | |
| Mar 26, 2018 at 10:29 | comment | added | Peter Heinig | Dear @Dominic: I proactively made some rather invasive changes. I think they improve the text. In particular, writing $T^{2n}$ seems unnecessary and even confusing to me, so I wrote $T(n)$. I also replaced 'copies' with 'translates'. | |
| Mar 26, 2018 at 10:28 | history | edited | Peter Heinig | CC BY-SA 3.0 |
Several stylistic changes, which seem improvements to me. One substantive change: the ambiguous term 'copies' replaced with the defined term 'translate'.
|
| Mar 26, 2018 at 9:54 | comment | added | Sylvain JULIEN | Actually I think the set of "copies" should form a group under composition of applications. So precising what this group is could help. | |
| Mar 26, 2018 at 9:51 | comment | added | Sylvain JULIEN | Do you mean "translations and rotations" by "copies" ? Or do you allow axial symmetries too ? | |
| Mar 26, 2018 at 9:33 | history | edited | Dominic van der Zypen |
edited tags
|
|
| Mar 26, 2018 at 9:18 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |