Abstract
We suggest necessary conditions for soficness of multidimensional shifts formulated in terms of resource-bounded Kolmogorov complexity. Using this technique we provide examples of effective and non-sofic shifts on Z2 with very low block complexity: the number of globally admissible patterns of size n×n grows only as a polynomial in n. We also show that more conventional proofs of non-soficness for multi-dimensional effective shifts, including the techniques of Pavlov (2013) [15] and Kass and Madden (2013) [6], can be expressed in terms of Kolmogorov complexity with unbounded computational resources.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
