Skip to Main content Skip to Navigation
Journal articles

Shifts with decidable language and non-computable entropy

Abstract : We consider subshifts of the full shift of all binary bi-infinite sequences. On the one hand, the topological entropy of any subshift with computably co-enumerable language is a right-computable real number between 0 and 1. We show that, on the other hand, any right-computable real number between 0 and 1, whether computable or not, is the entropy of some subshift with even polynomial time decidable language. In addition, we show that computability of the entropy of a subshift does not imply any kind of computability of the language of the subshift
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, April 3, 2014 - 4:13:29 PM
Last modification on : Wednesday, October 14, 2020 - 4:08:34 AM
Long-term archiving on: : Thursday, July 3, 2014 - 4:36:39 PM


Files produced by the author(s)




Peter Hertling, Christoph Spandl. Shifts with decidable language and non-computable entropy. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, Vol. 10 no. 3 (3), pp.75--93. ⟨10.46298/dmtcs.425⟩. ⟨hal-00972331⟩



Record views


Files downloads