Listing 1 - 10 of 26 | << page >> |
Sort by
|
Choose an application
Choose an application
This invaluable volume ends the quest to uncover the secret recipes for predicting the long-term evolution of a ring of identical elementary cells where the binary state of each cell during each generation of an attractor (i.e. after the transients had disappeared) is determined uniquely by the state of its left and right neighbors in the previous generation, as decreed by one of 256 truth tables. As befitting the contents aimed at school children, it was found pedagogically appealing to code each truth table by coloring each of the 8 vertices of a cubical graph in red (for binary state 1), or
Cellular automata. --- Computational complexity. --- Dynamics. --- Nonlinear theories. --- Nonlinear problems --- Nonlinearity (Mathematics) --- Calculus --- Mathematical analysis --- Mathematical physics --- Dynamical systems --- Kinetics --- Mathematics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Wolfram, Stephen. --- Wolfram, Stephen, --- Electronic books. --- Books in machine-readable form --- Digital books --- E-books --- Ebooks --- Online books --- Books --- Electronic publications --- Wolfram, S.
Choose an application
This penultimate volume contains numerous original, elegant, and surprising results in 1-dimensional cellular automata. Perhaps the most exciting, if not shocking, new result is the discovery that only 82 local rules, out of 256, suffice to predict the time evolution of any of the remaining 174 local rules from an arbitrary initial bit-string configuration. This is contrary to the well-known folklore that 256 local rules are necessary, leading to the new concept of quasi-global equivalence . Another surprising result is the introduction of a simple, yet explicit, infinite bit string called the
Cellular automata. --- Computational complexity. --- Dynamics. --- Nonlinear theories. --- Nonlinear problems --- Nonlinearity (Mathematics) --- Calculus --- Mathematical analysis --- Mathematical physics --- Dynamical systems --- Kinetics --- Mathematics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Complexity, Computational --- Electronic data processing --- Machine theory --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Wolfram, Stephen. --- Wolfram, Stephen,
Choose an application
Choose an application
Choose an application
Choose an application
This novel book introduces cellular automata from a rigorous nonlinear dynamics perspective. It supplies the missing link between nonlinear differential and difference equations to discrete symbolic analysis. A surprisingly useful interpretations of cellular automata in terms of neural networks is also given. The book provides a scientifically sound and original analysis, and classifications of the empirical results presented in Wolfram's monumental "New Kind of Science."
Cellular automata. --- Computational complexity. --- Dynamics. --- Nonlinear theories. --- Wolfram, Stephen, --- Wolfram, Stephen.
Choose an application
Volume III continues the author's quest for developing a pedagogical, self-contained, yet rigorous analytical theory of 1-D cellular automata via a nonlinear dynamics perspective. Using carefully conceived and illuminating color graphics, the global dynamical behaviors of the 50 (out of 256) local rules that have not yet been covered in Volumes I and II are exposed via their stunningly revealing basin tree diagrams. The Bernoulli στ-shift dynamics discovered in Volume II is generalized to hold for all 50 (or 18 globally equivalent) local rules via complex and hyper Bernoulli wave dynamics. E
Cellular automata. --- Computational complexity. --- Dynamics. --- Nonlinear theories. --- Wolfram, Stephen, --- Wolfram, Stephen.
Choose an application
Volume IV continues the author's odyssey on l-D cellular automata as chronicled in Volumes I, II and III, by uncovering a novel quasi-ergodicity phenomenon involving orbits meandering among omega-limit orbits of complex (group 5) and hyper (group 6) Bernoulli rules. This discovery is embellished with analytical formulas characterizing the fractal properties of characteristic functions, as well as explicit formulas for generating colorful and pedagogically revealing isomorphic basin tree diagrams. Many new results were derived and proved by uncovering subtle symmetries endowed by various subset
Cellular automata. --- Computational complexity. --- Dynamics. --- Nonlinear theories. --- Wolfram, Stephen,
Choose an application
Listing 1 - 10 of 26 | << page >> |
Sort by
|