Computational universality in symbolic dynamical systems

Lecture Notes in Computer Science

Volumn 3354, Issue , 2005, Pages 104-115

  Delvenne, Jean Charles ^a   Kůrka, Petr ^b   Blondel, Vincent D ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CHAOS THEORY; DISCRETE TIME CONTROL SYSTEMS; TURING MACHINES;

CHAOTIC SYSTEM; COMPUTATIONAL UNIVERSALITY; DYNAMICAL SYSTEMS; TAG SYSTEMS;

COMPUTATIONAL METHODS;

EID: 24144488667     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_8     Document Type: Conference Paper

References (24)

1. Siegelmann, H.: Neural Networks and Analog Computation: Beyond the Turing Limit. Progress in Theoretical Computer Science. Springer-Verlag (1999)
2. Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
3. Moore, C.: Unpredictability and undecidability in dynamical systems. Physical Review Letters 64 (1990) 2354-2357
4. Siegelmann, H., Fishman, S.: Analog computation with dynamical systems. Physica D 120 (1998) 214-235
5. Bournez, O., Cosnard, M.: On the computational power of dynamical systems and hybrid systems. Theoretical Computer Science 168 (1996) 417-459
6. Asarin, E., Bouajjani, A.: Perturbed Turing machines and hybrid systems. In: Proceedings of the 6th IEEE Symposium on Logic in Computer Science (LICS'01), Boston, USA, IEEE (2001)
7. Maass, W., Orponen, P.: On the effect of analog noise in discrete-time analog computations. Neural Computation 10 (1998) 1071-1095
8. Gacs, P.: Reliable cellular automata with self-organization. In: IEEE Symposium on Foundations of Computer Science. (1997) 90-99
9. Orponen, P.: A survey of continuous-time computation theory. In Du, D.Z., Ko, K.I., eds.: Advances in Algorithms, Languages, and Complexity. Kluwer Academic Publishers (1997) 209-224
10. Moore, C.: Finite-dimensional analog computers: Flows, maps, and recurrent neural networks. In Calude, C., Casti, J., Dinneen, M., eds.: Unconventional Models of Computation, Springer-Verlag (1998)
11. Moore, C.: Dynamical recognizers: real-time language recognition by analog computers. Theoretical Computer Science 201 (1998) 99-136
12. Mitchell, M., Hraber, P., Crutchfield, J.: Dynamic computation, and the "edge of chaos": A re-examination. In Cowan, G., Pines, D., Melzner, D., eds.: Complexity: Metaphors, Models, and Reality. Santa Fe Institute Proceedings, Volume 19, Addison-Wesley (1994) 497-513 Santa Fe Institute Working Paper 93-06-040.
13. Crutchfield, J., Young, K.: Computation at the onset of chaos. In Zurek, W., ed.: Complexity, Entropy and the Physics of Information. Addison-Wesley (1989) 223-269
14. Langton, C.: Computation at the edge of chaos. Physica D 42 (1990) 12-37
15. Moore, C.: Generalized shifts: Unpredictability and undecidability in dynamical systems. Nonlinearity 4 (1991) 199-230
16. Weihrauch, K.: Computable Analysis. Springer-Verlag (2000)
17. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)
18. Davis, M.: A note on universal Turing machines. In Shannon, C., McCarthy, J., eds.: Automata Studies. Princeton University Press (1956) 167-175
19. Conway, J.: Unpredictable iterations. In: Proceedings of the 1972 Number Theory Conference, Boulder, Colorado (1972) 49-52
20. Durand, B., Róka, Z.: The game of life: universality revisited. In Delorme, M., Mazoyer, J., eds.: Cellular Automata: a Parallel Model. Volume 460 of Mathematics and its Applications. Kluwer Academic Publishers (1999) 51-74
21. Kůrka, P.: Languages, equicontinuity and attractors in cellular automata. Ergodic Theory & Dynamical Systems 17 (1997) 417-433
22. Kůrka, P.: On topological dynamics of Turing machines. Theoretical Computer Science 174 (1997) 203-216
23. Devaney, R.: An Introduction to Chaotic Dynamical Systems. Addison-Wesley (1989)
24. Banks, J., Brooks, J., Cairns, G., Davis, G., Stacey, P.: On Devaney's definition of chaos. American Mathematics Monthly 99 (1992) 332-334