Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...p (mathematics)|group]] such that every [[injective function|injective]] [[cellular automaton]] with the group elements as its cells is also [[surjective funct A [[cellular automaton]] consists of a regular system of cells, each containing a symbol ...
    6 KB (801 words) - 02:29, 13 November 2023
  • {{Short description|Cellular automaton with probabilistic rules}} ...or '''probabilistic cellular automata''' ('''PCA''') or '''random cellular automata''' or '''locally interacting [[Markov chain]]s'''<ref>{{citation ...
    7 KB (979 words) - 02:18, 30 October 2024
  • ...ematical [[Characterization (mathematics)|characterization]] of [[cellular automata]] in terms of their [[symbolic dynamics]]. It is named after [[Morton L. Cu | title = Cellular automata and groups, by Tullio Ceccherini-Silberstein and Michel Coornaert (book rev ...
    12 KB (1,849 words) - 11:00, 18 October 2024
  • ...llular automata]] or [[Stochastic cellular automata|probabilistic cellular automata]] over <math>\mathbb{Z}^k</math> or [[interacting particle systems]] when s == Generalized cellular automata (GCA) == ...
    10 KB (1,521 words) - 03:38, 26 December 2024
  • {{Short description|Continuous generalization of cellular automata}} ...in Lenia are described as differing from those appearing in other cellular automata, being "geometric, [[Metamerism (biology)|metameric]], fuzzy, resilient, ad ...
    12 KB (1,904 words) - 21:08, 1 December 2024
  • ...ernd Gartner |first=Ahad N. Zehmakan |year=2017 |title=Color War: Cellular Automata with Majority Rule |journal=Lata2017 |pages=393–404}}</ref> The model also [[File:CA-Tooms_neighborhood.svg|thumbnail|Neighborhood of Toom's cellular automaton. ]] ...
    8 KB (1,347 words) - 16:09, 5 January 2024
  • |title = Movable cellular automaton method |caption = Animation of a movable cellular automaton being used to simulate [[friction]] at the interface between two ...
    19 KB (2,703 words) - 17:21, 28 September 2024
  • The '''Ulam–Warburton [[cellular automaton]]''' (UWCA) is a 2-dimensional [[fractal]] pattern that grows on ...f 188]''' (2002), 11 </ref><ref>[[David_Singmaster|D. Singmaster]], On the cellular automaton of Ulam and Warburton, [http://m500.org.uk/magazine/ M500 Magazin ...
    12 KB (1,742 words) - 02:22, 29 October 2022
  • ...It was a precursor to the [[lattice Boltzmann methods]]. From lattice gas automata, it is possible to derive the macroscopic [[Navier-Stokes equation]]s.<ref> ...luid-mechanics/A1CF87F3328666715F18278ADEE51786 |work=Lattice-Gas Cellular Automata: Simple Models of Complex Hydrodynamics |pages=1–11 |editor-last=Rothman |e ...
    7 KB (1,030 words) - 04:24, 23 July 2023
  • ...etermined in Rule 30, one of the 256 possible rules of elementary cellular automata.]] ...mulae.org/?script=examples/Elementary_cellular_automaton |title=Elementary cellular automaton in the Fōrmulæ programming language |first=Laurence |last = R.Uga ...
    24 KB (3,239 words) - 02:50, 10 June 2024
  • ...r Automaton''' (abbrev. '''GH model''') is a three state two dimensional [[cellular automaton]] (abbrev '''CA''') named after James M. Greenberg and Stuart Has As in a typical two dimensional [[cellular automaton]],<ref name="siam" /> consider a rectangular grid, or checkerboar ...
    11 KB (1,703 words) - 22:48, 24 March 2020
  • ...ystems]] which generalize many aspects of for example classical [[cellular automata]], and they provide a framework for studying asynchronous processes over [[ ...
    4 KB (669 words) - 00:32, 3 March 2023
  • ''The Nonlinear Workbook: Chaos, Fractals, Cellular Automata, Neural Networks, Genetic Algorithm, Gene Expression Programming, Wavelets, ...
    7 KB (939 words) - 17:08, 27 January 2025
  • ...ear science series 6}}</ref> However, the value of each site in a cellular automata network is strictly dependent on its neighbor(s) from the previous time ste *[[Cellular automata]] ...
    19 KB (2,556 words) - 11:44, 4 October 2024
  • == Example: rule 110 variant of the elementary cellular automaton == The [[rule 110]] variant of the [[elementary cellular automaton]] has been [[Rule 110#The proof of universality|proven]] to be ca ...
    27 KB (3,896 words) - 18:09, 10 November 2024
  • ...components. IPS are the continuous-time analogue of [[stochastic cellular automata]]. ...
    7 KB (1,033 words) - 12:19, 13 February 2024
  • * [[stochastic cellular automata|Probabilistic Cellular Automata]] ...
    23 KB (3,736 words) - 17:33, 26 November 2024
  • ...is, dating back to the 1960s, states that the entire universe is a huge [[cellular automaton]] which continuously updates its rules.<ref name="Fredkin90">Fred ...established "classical" nature-inspired models of computation are cellular automata, neural computation, and evolutionary computation. More recent computationa ...
    44 KB (5,995 words) - 17:48, 7 September 2024
  • ...inary operations, used to characterize one-dimensional reversible cellular automata ...
    8 KB (1,254 words) - 01:09, 4 November 2024
  • ...tt (1996) "Periodic travelling waves in a family of deterministic cellular automata", ''Physica D'' 95: 319–335. ...urbage (1997) "On the abundance of traveling waves in 1D infinite cellular automata", ''Physica D'' 103: 133–144. ...
    28 KB (3,768 words) - 08:38, 14 October 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)