Seas of squares with sizes from a $\Pi^0_1$ set
@article{Westrick2016SeasOS, title={Seas of squares with sizes from a \$\Pi^0_1\$ set}, author={L. Westrick}, journal={arXiv: Dynamical Systems}, year={2016} }
For each $\Pi^0_1$ $S\subseteq \mathbb{N}$, let the $S$-square shift be the two-dimensional subshift on the alphabet $\{0,1\}$ whose elements consist of squares of 1s of various sizes on a background of 0s, where the side length of each square is in $S$. Similarly, let the distinct-square shift consist of seas of squares such that no two finite squares have the same size. Extending the self-similar Turing machine tiling construction of Durand, Romashchenko and Shen, we show that if $X$ is an $S… CONTINUE READING
5 Citations
Resource-Bounded Kolmogorov Complexity Provides an Obstacle to Soficness of Multidimensional Shifts
- Computer Science, Mathematics
- STACS
- 2019
- 2
- PDF
Countable Sofic Shifts with a Periodic Direction
- Mathematics, Computer Science
- Theory of Computing Systems
- 2019
- PDF
References
SHOWING 1-10 OF 18 REFERENCES
Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type
- Mathematics, Computer Science
- ArXiv
- 2016
- 60
- PDF
Computability Theoretic Properties of the Entropy of Gap Shifts
- Computer Science, Mathematics
- Fundam. Informaticae
- 2008
- 7
Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
- Mathematics, Computer Science
- STACS
- 2006
- 30
- PDF
A characterization of the entropies of multidimensional shifts of finite type
- Mathematics
- 2010
- 134
- Highly Influential
- PDF