For a finite $S \subset \mathbb{Z}^d$, let $d_p(S)$ be its optimal packing density. That is, the maximal lower asymptotic density of $A+S$, where $A \subset \mathbb{Z}^d$ is such that $(a_1+S)\cap (a_2+S)=\varnothing$ for all distinct $a_1,a_2 \in A$.
Does there exist a finite $S \subset \mathbb{Z}^d$ such that $d_p(S)$ is irrational?
Note that $d_p(S)=1$ if and only if $S$ tiles $\mathbb{Z}^d$. (Indeed, if $S$ does not tile $\mathbb{Z}^d$, then it does not tile some cube $[N]^d$ by compactness argument. So for every packing, at least one point in every translate of $[N]^d$ is uncovered, and thus $d_p(S) \le 1-N^{-d}$.) In the light of the latest preprint of Greenfeld and Tao, it seems that for $d \ge 3$, this function is not computable.
At the same time, if $d=1$, then the optimal packing is always periodic, with the period length bounded by $2^{\mbox{diam}(S)}$. Hence, $d_p(S)$ is computable, and the answer to my question is No in this case.