|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 4 van 13 gevonden artikelen
| Titel: |
Decidability and Universality in Symbolic Dynamical Systems |
| Auteur: |
Delvenne, Jean-Charles Kůrka, Petr Blondel, Vincent |
| Verschenen in: |
Fundamenta informaticae |
| Paginering: | Jaargang 74 (2006) nr. 4 pagina's 463-490 |
| Jaar: |
2006-12-12 |
| Inhoud: |
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical systems. Universality of a system is defined as undecidability of a model-checking problem. For Turing machines, counter machines and tag systems, our definition coincides with the classical one. It yields, however, a new definition for cellular automata and subshifts. Our definition is robust with respect to initial condition, which is a desirable feature for physical realizability. We derive necessary conditions for undecidability and universality. For instance, a universal system must have a sensitive point and a proper subsystem. We conjecture that universal systems have infinite number of subsystems. We also discuss the thesis according to which computation should occur at the 'edge of chaos' and we exhibit a universal chaotic system. |
| Uitgever: |
IOS Press |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 4 van 13 gevonden artikelen
| << vorige | volgende >> |