Complexity of combinatorial questions and dichotomy theorems (problem 1)
Statement
Are the following decidable? \begin{enumerate}[a.] \item Given a finite set of tiles in , is there a continuous tiling of with those tiles? \item Same as a, but where we are given that there is a (not necessarily definable) tiling. I.e, a tiling of the Cayley graph with those tiles. \end{enumerate}
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.