Computational capabilities at the edge of chaos for one dimensional systems undergoing continuous transitions.

While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular automata, there is an enhancement of computation capabilities as the system moves towards cellular automata with chaotic spatiotemporal behavior. The computation capabilities are followed by looking into the Shannon entropy rate and the excess entropy, which allow identifying the balance between unpredictability and complexity.

Determination of stacking ordering in disordered close-packed structures from pairwise correlation functions.

It is shown how to reconstruct the stacking sequence from the pairwise correlation functions between layers in close-packed structures. First, of theoretical interest, the analytical formulation and solution of the problem are presented when the exact pairwise correlation counts are known. In the second part, the practical problem is approached.

Extrinsic faulting in 3C close-packed crystal structures: computational mechanics analysis.

Extrinsic faulting has been discussed previously within the so-called difference method and random walk calculation. In this contribution it is revisited under the framework of computational mechanics, which allows expressions to be derived for the statistical complexity, entropy density and excess entropy as a function of faulting probability. The approach allows one to compare the disordering process of an extrinsic fault with other faulting types.

Close-packed structure dynamics with finite-range interaction: computational mechanics with individual layer interaction.

This is the second contribution in a series of papers dealing with dynamical models in equilibrium theories of polytypism. A Hamiltonian introduced by Ahmad & Khan [Phys. Status Solidi B (2000), 218, 425-430] avoids the unphysical assignment of interaction terms to fictitious entities given by spins in the Hägg coding of the stacking arrangement.

Close-packed structures with finite-range interaction: computational mechanics of layer pair interaction.

The stacking problem is approached by computational mechanics, using an Ising next-nearest-neighbour model. Computational mechanics allows one to treat the stacking arrangement as an information processing system in the light of a symbol-generating process. A general method for solving the stochastic matrix of the random Gibbs field is presented and then applied to the problem at hand.