they were used in von Neumann's universal constructor. Nobili cellular automaton is a variation of von Neumann's cellular automaton, augmented with the...

stochastic cellular automaton and asynchronous cellular automaton. The concept was originally discovered in the 1940s by Stanislaw Ulam and John von Neumann while...

ruleset. Artificial life Cellular automaton Conway's Game of Life Langton's loops Von Neumann cellular automaton Wireworld von Neumann, John; Burks, Arthur...

neighborhood is named after John von Neumann, who used it to define the von Neumann cellular automaton and the von Neumann universal constructor within it...

John von Neumann's universal constructor is a self-replicating machine in a cellular automaton (CA) environment. It was designed in the 1940s, without...

initial configuration of cells. The Von Neumann universal constructor based on the von Neumann cellular automaton was fleshed out in his posthumous Theory...

assignment von Neumann cellular automaton von Neumann conjecture Murray–von Neumann coupling constant Jordan–von Neumann constant von Neumann's elephant von Neumann...

self-replication The Von Neumann cellular automaton This disambiguation page lists articles associated with the title Von Neumann machine. If an internal...

John von Neumann. The same name may also refer to quantum dot cellular automata, which are a proposed physical implementation of "classical" cellular automata...

In a cellular automaton, a gun is a pattern with a main part that repeats periodically, like an oscillator, and that also periodically emits spaceships...

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells,...

In cellular automata, a methuselah is a small "seed" pattern of initial live cells that take a large number of generations in order to stabilize. More...

In 1952 John von Neumann created the first cellular automaton (CA) with the goal of creating a self-replicating machine. This automaton was necessarily...

Seeds is a cellular automaton in the same family as the Game of Life, initially investigated by Brian Silverman and named by Mirek Wójtowicz. It consists...

A cyclic cellular automaton is a kind of cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers...

In cellular automata such as Conway's Game of Life, a breeder is a pattern that exhibits quadratic growth, by generating multiple copies of a secondary...

the new states influence other cells. In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that...

working within a cellular automaton with a small neighbourhood (only those cells that touch are neighbours; for von Neumann's cellular automata, only orthogonal...

In a cellular automaton, a finite pattern is called a spaceship if it reappears after a certain number of generations in the same orientation but in a...

cellular automaton similar to Conway's Game of Life. It was devised in 1994 by Nathan Thompson. It is a two-dimensional, two-state cellular automaton...

In a cellular automaton, an oscillator is a pattern that returns to its original state, in the same orientation and position, after a finite number of...

implemented as a cellular automaton. von Neumann's cellular automaton Dewdney, A K (January 1990). "Computer recreations: The cellular automata programs...

been devised in analogy to conventional models of cellular automata introduced by John von Neumann. Any device designed to represent data and perform...

configuration of von Neumann cellular automata, and the computational throughput is increased. In von Neumann's original cellular automaton, the crossing...

CoDi is a cellular automaton (CA) model for spiking neural networks (SNNs). CoDi is an acronym for Collect and Distribute, referring to the signals and...

be able to evolve and which he formalized in a cellular automata environment. Notably, Von Neumann's Self-Reproducing Automata scheme posited that open-ended...

In a cellular automaton, a finite pattern is called a sawtooth if its population grows without bound but does not tend to infinity. In other words, a sawtooth...

computing devices Von Neumann universal constructor – Self-replicating cellular automaton From lecture transcript attributed to John von Neumann, as quoted by...

A rake, in the lexicon of cellular automata, is a type of puffer train, which is an automaton that leaves behind a trail of debris. In the case of a rake...

that any cellular automaton could be represented as a convolutional neural network, and trained neural networks to reproduce existing cellular automata...