Discrete Mathematics & Theoretical Computer Science
| author: | Pascal Koiran |
|---|---|
| title: | The topological entropy of iterated piecewise affine maps is uncomputable |
| keywords: | topological entropy, piecewise affine functions, saturated linear functions, cellular automata |
| abstract: | We show that it is impossible to compute (or even to approximate) topological entropy of a continuous piecewise affine function in dimension four. The same result holds for saturated linear functions in unbounded dimension. We ask whether the topological entropy of a piecewise affine function is always a computable real number, and conversely whether every non-negative computable real number can be obtained as the topological entropy of a piecewise affine function. It seems that these two questions are also open for cellular automata. |
| reference: | Pascal Koiran (2001), The topological entropy of iterated piecewise affine maps is uncomputable, Discrete Mathematics and Theoretical Computer Science 4, pp. 351-356 |
| bibtex: | For a corresponding BibTeX entry, please consider our BibTeX-file. |
| ps.gz-source: | dm040219.ps.gz (29 K) |
| ps-source: | dm040219.ps (80 K) |
| pdf-source: | dm040219.pdf (79 K) |
The first source gives you the `gzipped' PostScript, the second the plain PostScript and the third the format for the Adobe accrobat reader. Depending on the installation of your web browser, at least one of these should (after some amount of time) pop up a window for you that shows the full article. If this is not the case, you should contact your system administrator to install your browser correctly.
Due to limitations of your local software, the two formats may show up differently on your screen. If eg you use xpdf to visualize pdf, some of the graphics in the file may not come across. On the other hand, pdf has a capacity of giving links to sections, bibliography and external references that will not appear with PostScript.