Algorithmic crystal chemistry: A cellular automata approach

doi:10.1134/S1063774511060149

Title: Algorithmic crystal chemistry: A cellular automata approach

Full Record
Other Related Research

Abstract

Atomic-molecular mechanisms of crystal growth can be modeled based on crystallochemical information using cellular automata (a particular case of finite deterministic automata). In particular, the formation of heteropolyhedral layered complexes in uranyl selenates can be modeled applying a one-dimensional three-colored cellular automaton. The use of the theory of calculations (in particular, the theory of automata) in crystallography allows one to interpret crystal growth as a computational process (the realization of an algorithm or program with a finite number of steps).

Authors:

Krivovichev, S. V., E-mail: skrivovi@mail.ru ^[1]

St. Petersburg State University (Russian Federation)

Publication Date:: Sun Jan 15 00:00:00 EST 2012

OSTI Identifier:: 22054204

Resource Type:: Journal Article

Journal Name:: Crystallography Reports

Additional Journal Information:: Journal Volume: 57; Journal Issue: 1; Other Information: Copyright (c) 2012 Pleiades Publishing, Ltd.; Country of input: International Atomic Energy Agency (IAEA); Journal ID: ISSN 1063-7745

Country of Publication:: United States

Language:: English

Subject:: 75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND SUPERFLUIDITY; ALGORITHMS; CRYSTAL GROWTH; CRYSTALLOGRAPHY; CRYSTALS; SELENATES

Citation Formats


                    Krivovichev, S. V., E-mail: skrivovi@mail.ru. Algorithmic crystal chemistry: A cellular automata approach.  United States: N. p., 2012. 
        Web.  doi:10.1134/S1063774511060149.

Copy to clipboard


                    Krivovichev, S. V., E-mail: skrivovi@mail.ru. Algorithmic crystal chemistry: A cellular automata approach.  United States.  https://doi.org/10.1134/S1063774511060149

Copy to clipboard


                    Krivovichev, S. V., E-mail: skrivovi@mail.ru. 2012.  
        "Algorithmic crystal chemistry: A cellular automata approach".  United States.  https://doi.org/10.1134/S1063774511060149.

Copy to clipboard


                    
@article{osti_22054204,

  title        = {Algorithmic crystal chemistry: A cellular automata approach},

  author       = {Krivovichev, S. V., E-mail: skrivovi@mail.ru},

  abstractNote = {Atomic-molecular mechanisms of crystal growth can be modeled based on crystallochemical information using cellular automata (a particular case of finite deterministic automata). In particular, the formation of heteropolyhedral layered complexes in uranyl selenates can be modeled applying a one-dimensional three-colored cellular automaton. The use of the theory of calculations (in particular, the theory of automata) in crystallography allows one to interpret crystal growth as a computational process (the realization of an algorithm or program with a finite number of steps).},

  doi          = {10.1134/S1063774511060149},

  url          = {https://www.osti.gov/biblio/22054204},
  journal      = {Crystallography Reports},

  issn         = {1063-7745},

  number       = 1,

  volume       = 57,

  place        = {United States},

  year         = {Sun Jan 15 00:00:00 EST 2012},

  month        = {Sun Jan 15 00:00:00 EST 2012}

}

Copy to clipboard

Journal Article:

https://doi.org/10.1134/S1063774511060149

Other availability

Find in Google Scholar

Search WorldCat to find libraries that may hold this journal

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Statistical mechanics of cellular automata

Journal Article Wolfram, S - Rev. Mod. Phys.; (United States)

Cellular automata are used as simple mathematical models to investigate self-organization in statistical mechanics. A detailed analysis is given of ''elementary'' cellular automata consisting of a sequence of sites with values 0 or 1 on a line, with each site evolving deterministically in discrete time steps according to p definite rules involving the values of its nearest neighbors. With simple initial configurations, the cellular automata either tend to homogeneous states, or generate self-similar patterns with fractal dimensions approx. =1.59 or approx. =1.69. With ''random'' initial configurations, the irreversible character of the cellular automaton evolution leads to several self-organization phenomena. Statisticalmore »« less
https://doi.org/10.1103/RevModPhys.55.601
Aperiodicity in one-dimensional cellular automata

Conference Jen, E

Cellular automata are a class of mathematical systems characterized by discreteness (in space, time, and state values), determinism, and local interaction. A certain class of one-dimensional, binary site-valued, nearest-neighbor automata is shown to generate infinitely many aperiodic temporal sequences from arbitrary finite initial conditions on an infinite lattice. The class of automaton rules that generate aperiodic temporal sequences are characterized by a particular form of injectivity in their interaction rules. Included are the nontrivial linear'' automaton rules (that is, rules for which the superposition principle holds); certain nonlinear automata that retain injectivity properties similar to those of linear automata; andmore »« less
https://doi.org/10.1016/0167-2789(90)90169-P

Full Text Available
Statistical properties of cellular automata in the context of learning and recognition: Part 1, Introduction

Conference Gutowitz, H

In this lecture the map from a cellular automaton to a sequence of analytical approximations called the local structure theory is described. Connections are drawn between cellular automata and neural network models. It is suggested that the process by which a cellular automaton holds particular probability measures invariant is an appropriate model for biological memory. 20 figs.
Full Text Available
From quantum cellular automata to quantum lattice gases

Journal Article Meyer, D - Journal of Statistical Physics

A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one-parameter family of evolution rules which are best interpreted as those for a one-particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. Wemore »« less
https://doi.org/10.1007/BF02199356
Statistical properties of cellular automata in the context of learning and recognition: Part 2, inverting local structure theory equations to find cellular automata with specified properties

Conference Gutowitz, H

This is the second of two lectures. In the first lecture the map from a cellular automaton to a sequence of analytical approximations called the local structure theory was described. In this lecture the inverse map from approximation to the class of cellular automata approximated is constructed. The key matter is formatting the local structure theory equations in terms of block probability estimates weighted by coefficients. The inverse mapping relies on this format. Each possible assignment of values to the coefficients defines a class of automata with related statistical properties. It is suggested that these coefficients serve to smoothly parameterizemore »« less
Full Text Available

Similar Records