Turing Universality in Dynamical Systems
Lecture Notes in Computer Science
Springer Berlin / Heidelberg
0302-9743 (Print) 1611-3349 (Online)
Volume 3988/2006
Logical Approaches to Computational Barriers
DOI 10.1007/11780342
Jean-Charles Delvenne
http://www.springerlink.com/content/j2886073h5176431/
Abstract
A computer is classically formalized as a universal Turing machine. However
over the years a lot of research has focused on the computational properties
of dynamical systems other than Turing machines, such cellular automata,
artificial neural networks, mirrors systems, etc.
In this talk we review some of the definitions that have been proposed for
Turing universality of various systems, and the attempts to understand the
relation between dynamical and computational properties of a system.
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 218.212.57.150