On the computability of the topological entropy of subshifts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2006

On the computability of the topological entropy of subshifts

Abstract

We prove that the topological entropy of subshifts having decidable language is uncomputable in the following sense: For no error bound less than 1/4 does there exists a program that, given a decision procedure for the language of a subshift as input, will approximate the entropy of the subshift within the error bound. In addition, we prove that not only is the topological entropy of sofic shifts computable to arbitary precision (a well-known fact), but all standard comparisons of the topological entropy with rational numbers are decidable.
Fichier principal
Vignette du fichier
456-1734-1-PB.pdf (159.62 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00961115 , version 1 (20-03-2014)

Identifiers

Cite

Jakob Grue Simonsen. On the computability of the topological entropy of subshifts. Discrete Mathematics and Theoretical Computer Science, 2006, Vol. 8, pp.83--95. ⟨10.46298/dmtcs.365⟩. ⟨hal-00961115⟩

Collections

TDS-MACS
63 View
1115 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More