61 research outputs found
Computation in Finitary Stochastic and Quantum Processes
We introduce stochastic and quantum finite-state transducers as
computation-theoretic models of classical stochastic and quantum finitary
processes. Formal process languages, representing the distribution over a
process's behaviors, are recognized and generated by suitable specializations.
We characterize and compare deterministic and nondeterministic versions,
summarizing their relative computational power in a hierarchy of finitary
process languages. Quantum finite-state transducers and generators are a first
step toward a computation-theoretic analysis of individual, repeatedly measured
quantum dynamical systems. They are explored via several physical systems,
including an iterated beam splitter, an atom in a magnetic field, and atoms in
an ion trap--a special case of which implements the Deutsch quantum algorithm.
We show that these systems' behaviors, and so their information processing
capacity, depends sensitively on the measurement protocol.Comment: 25 pages, 16 figures, 1 table; http://cse.ucdavis.edu/~cmg; numerous
corrections and update
Proceedings of JAC 2010. Journées Automates Cellulaires
The second Symposium on Cellular Automata “Journ´ees Automates Cellulaires” (JAC 2010) took place in Turku, Finland, on December 15-17, 2010. The first two conference days were held in the Educarium building of the University of Turku, while the talks of the third day were given onboard passenger ferry boats in the beautiful Turku archipelago, along the route Turku–Mariehamn–Turku. The conference was organized by FUNDIM, the Fundamentals of Computing and Discrete Mathematics research center at the mathematics department of the University of Turku.
The program of the conference included 17 submitted papers that were selected by the international program committee, based on three peer reviews of each paper. These papers form the core of these proceedings. I want to thank the members of the program committee and the external referees for the excellent work that have done in choosing the papers to be presented in the conference. In addition to the submitted papers, the program of JAC 2010 included four distinguished invited speakers: Michel Coornaert (Universit´e de Strasbourg, France), Bruno Durand (Universit´e de Provence, Marseille, France), Dora Giammarresi (Universit` a di Roma Tor Vergata, Italy) and Martin Kutrib (Universit¨at Gie_en, Germany). I sincerely thank the invited speakers for accepting our invitation to come and give a plenary talk in the conference. The invited talk by Bruno Durand was eventually given by his co-author Alexander Shen, and I thank him for accepting to make the presentation with a short notice. Abstracts or extended abstracts of the invited presentations appear in the first part of this volume.
The program also included several informal presentations describing very recent developments and ongoing research projects. I wish to thank all the speakers for their contribution to the success of the symposium. I also would like to thank the sponsors and our collaborators: the Finnish Academy of Science and Letters, the French National Research Agency project EMC (ANR-09-BLAN-0164), Turku Centre for Computer Science, the University of Turku, and Centro Hotel. Finally, I sincerely thank the members of the local organizing committee for making the conference possible.
These proceedings are published both in an electronic format and in print. The electronic proceedings are available on the electronic repository HAL, managed by several French research agencies. The printed version is published in the general publications series of TUCS, Turku Centre for Computer Science. We thank both HAL and TUCS for accepting to publish the proceedings.Siirretty Doriast
Many Roads to Synchrony: Natural Time Scales and Their Algorithms
We consider two important time scales---the Markov and cryptic orders---that
monitor how an observer synchronizes to a finitary stochastic process. We show
how to compute these orders exactly and that they are most efficiently
calculated from the epsilon-machine, a process's minimal unifilar model.
Surprisingly, though the Markov order is a basic concept from stochastic
process theory, it is not a probabilistic property of a process. Rather, it is
a topological property and, moreover, it is not computable from any
finite-state model other than the epsilon-machine. Via an exhaustive survey, we
close by demonstrating that infinite Markov and infinite cryptic orders are a
dominant feature in the space of finite-memory processes. We draw out the roles
played in statistical mechanical spin systems by these two complementary length
scales.Comment: 17 pages, 16 figures:
http://cse.ucdavis.edu/~cmg/compmech/pubs/kro.htm. Santa Fe Institute Working
Paper 10-11-02
Recommended from our members
C*-Algebren
The theory of C*-algebras plays a major role in many areas of modern mathematics, like Non-commutative Geometry, Dynamical Systems, Harmonic Analysis, and Topology, to name a few. The aim of the conference “C*-algebras” is to bring together experts from all those areas to provide a present day picture and to initiate new cooperations in this fast growing mathematical field
KMS States, Entropy and the Variational Principle in full C*-dynamical systems
To any periodic, unital and full C*-dynamical system (A, \alpha, R) an
invertible operator s acting on the Banach space of trace functionals of the
fixed point algebra is canonically associated. KMS states correspond to
positive eigenvectors of s. A Perron-Frobenius type theorem asserts the
existence of KMS states at inverse temperatures equal the logarithms of the
inner and outer spectral radii of s (extremal KMS states). Examples arising
from subshifts in symbolic dynamics, self-similar sets in fractal geometry and
noncommutative metric spaces are discussed.
Certain subshifts are naturally associated to the system and the relationship
between their topological entropy and inverse temperatures of extremal KMS
states are given.
Noncommutative shift maps are considered. It is shown that their entropy is
bounded by the sum of the entropy of the associated subshift and a suitable
entropy computed in the homogeneous subalgebra. Examples are discussed among
Matsumoto algebras associated to certain non finite type subshifts.
The CNT entropy is compared to the classical measure-theoretic entropy of the
subshift. A noncommutative analogue of the classical variational principle for
the entropy of subshifts is obtained for the noncommutative shift of certain
Matsumoto algebras. More generally, a necessary condition is discussed. In the
case of Cuntz-Krieger algebras an explicit construction of the state with
maximal entropy from the unique KMS state is done.Comment: 52 pages, AMSTeX. An error in Prop. 7.3 v1 has been corrected, and
related text in sections 7-9 has been modified. References added. Abstract
modifie
On some one-sided dynamics of cellular automata
A dynamical system consists of a space of all possible world states and a transformation of said space. Cellular automata are dynamical systems where the space is a set of one- or two-way infinite symbol sequences and the transformation is defined by a homogenous local rule. In the setting of cellular automata, the geometry of the underlying space allows one to define one-sided variants of some dynamical properties; this thesis considers some such one-sided dynamics of cellular automata.
One main topic are the dynamical concepts of expansivity and that of pseudo-orbit tracing property. Expansivity is a strong form of sensitivity to the initial conditions while pseudo-orbit tracing property is a type of approximability. For cellular automata we define one-sided variants of both of these concepts. We give some examples of cellular automata with these properties and prove, for example, that right-expansive cellular automata are chain-mixing. We also show that left-sided pseudo-orbit tracing property together with right-sided expansivity imply that a cellular automaton has the pseudo-orbit tracing property.
Another main topic is conjugacy. Two dynamical systems are conjugate if, in a dynamical sense, they are the same system. We show that for one-sided cellular automata conjugacy is undecidable. In fact the result is stronger and shows that the relations of being a factor or a susbsystem are undecidable, too
- …