|
Block Cellular Automaton
A block cellular automaton or partitioning cellular automaton is a special kind of cellular automaton in which the lattice of cells is divided into non-overlapping blocks (with different partitions at different time steps) and the transition rule is applied to a whole block at a time rather than a single cell. Block cellular automata are useful for simulations of physical quantities, because it is straightforward to choose transition rules that obey physical constraints such as reversibility and conservation laws. Definition A block cellular automaton consists of the following components: *A regular lattice of cells *A finite set of the states that each cell may be in *A partition of the cells into a uniform tessellation in which each tile of the partition has the same size and shape *A rule for shifting the partition after each time step *A transition rule, a function that takes as input an assignment of states for the cells in a single tile and produces as output another assign ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Margolus Block Neighborhood
Margolus is a surname that, like its variants shown below, is derived from the Ashkenazi Hebrew pronunciation of the Hebrew word (Israeli Hebrew [maɹgalit]), meaning 'pearl,' and may refer to: *Norman Margolus, Canadian-American physicist and computer scientist See also * Margolis * Margolies * Margules * Margulies * Margulis * Margolin * Miriam Margolyes * Margolius {{surname Jewish surnames Hebrew-language surnames ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Billiard-ball Computer
A billiard-ball computer, a type of conservative logic circuit, is an idealized model of a reversible mechanical computer based on Newtonian dynamics, proposed in 1982 by Edward Fredkin and Tommaso Toffoli. Instead of using electronic signals like a conventional computer, it relies on the motion of spherical billiard balls in a friction-free environment made of buffers against which the balls bounce perfectly. It was devised to investigate the relation between computation and reversible processes in physics. Simulating circuits with billiard balls This model can be used to simulate Boolean circuits in which the wires of the circuit correspond to paths on which one of the balls may travel, the signal on a wire is encoded by the presence or absence of a ball on that path, and the gates of the circuit are simulated by collisions of balls at points where their paths cross. In particular, it is possible to set up the paths of the balls and the buffers around them to form a reversible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Margolus Toothpick Animated
Margolus is a surname that, like its variants shown below, is derived from the Ashkenazi Hebrew pronunciation of the Hebrew word (Israeli Hebrew aɹgalit, meaning 'pearl,' and may refer to: *Norman Margolus, Canadian-American physicist and computer scientist See also * Margolis * Margolies * Margules * Margulies * Margulis * Margolin * Miriam Margolyes Miriam ( he, מִרְיָם ''Mīryām'', lit. 'Rebellion') is described in the Hebrew Bible as the daughter of Amram and Jochebed, and the older sister of Moses and Aaron. She was a prophetess and first appears in the Book of Exodus. The Tora ... * Margolius {{surname Jewish surnames Hebrew-language surnames ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parity (mathematics)
In mathematics, parity is the property of an integer of whether it is even or odd. An integer is even if it is a multiple of two, and odd if it is not.. For example, −4, 0, 82 are even because \begin -2 \cdot 2 &= -4 \\ 0 \cdot 2 &= 0 \\ 41 \cdot 2 &= 82 \end By contrast, −3, 5, 7, 21 are odd numbers. The above definition of parity applies only to integer numbers, hence it cannot be applied to numbers like 1/2 or 4.201. See the section "Higher mathematics" below for some extensions of the notion of parity to a larger class of "numbers" or in other more general settings. Even and odd numbers have opposite parities, e.g., 22 (even number) and 13 (odd number) have opposite parities. In particular, the parity of zero is even. Any two consecutive integers have opposite parity. A number (i.e., integer) expressed in the decimal numeral system is even or odd according to whether its last digit is even or odd. That is, if the last digit is 1, 3, 5, 7, or 9, then it is odd; otherwis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Asynchronous Cellular Automaton
Cellular automata, as with other multi-agent system models, usually treat time as discrete and state updates as occurring synchronously. The state of every cell in the model is updated together, before any of the new states influence other cells. In contrast, an asynchronous cellular automaton is able to update individual cells independently, in such a way that the new state of a cell affects the calculation of states in neighbouring cells. Implementations of synchronous updating can be analysed in two phases. The first, interaction, calculates the new state of each cell based on the neighbourhood and the update rule. State values are held in a temporary store. The second phase updates state values by copying the new states to the cells. In contrast, asynchronous updating does not necessarily separate these two phases: in the simplest case (fully asynchronous updating), changes in state are implemented immediately. The synchronous approach assumes the presence of a global cloc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trip-a-Tron
Trip-a-Tron is a light synthesizer written by Jeff Minter and published through his Llamasoft company in 1988. It was originally written for the Atari ST and later ported to the Amiga in 1990 by Andy Fowler. Description Trip-A-Tron was released as shareware, but also came in a commercial package with a 3-ring-bound manual and 2 game disks. The trial version contained no limitations, but registration was necessary to obtain the manual, which in turn was necessary to learn the script language ("KML" - supposedly "Keyboard Macro Language" and only coincidentally the phonetic equivalent of "camel") which drove the system. The software has a usable but quirky user interface, filled with in-jokes and references to Llamasoft mascots. For example, the button to exit from the MIDI editor is labelled "naff off", while the button to exit the file display is labelled with a sheep saying "Baa!"; the waveform editor colour cycles the words "Dead cool" above the waveform display, and the e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oscillator (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 generations. Thus the evolution of such a pattern repeats itself indefinitely. Depending on context, the term may also include spaceships as well. The smallest number of generations it takes before the pattern returns to its initial condition is called the ''period'' of the oscillator. An oscillator with a period of 1 is usually called a still life, as such a pattern never changes. Sometimes, still lifes are not taken to be oscillators. Another common stipulation is that an oscillator must be finite. Examples In Conway's Game of Life, finite oscillators are known to exist for all periods except 19 and 41. Additionally, until July 2022, the only known examples for period 34 were considered trivial because they consisted of essentially separate components that oscillate at smaller periods. For instance, one can create a period 34 osc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spaceship (cellular Automaton)
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 different position. The smallest such number of generations is called the period of the spaceship. Description The speed of a spaceship is often expressed in terms of ''c'', the metaphorical speed of light (one cell per generation) which in many cellular automata is the fastest that an effect can spread. For example, a glider in Conway's Game of Life is said to have a speed of c/4, as it takes four generations for a given state to be translated by one cell. Similarly, the ''lightweight spaceship'' is said to have a speed of c/2, as it takes four generations for a given state to be translated by two cells. More generally, if a spaceship in a 2D automaton with the Moore neighborhood is translated by (x, y) after n generations, then the speed v is defined as: This notation can be readily generalised to cellular automata with di ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Glider (Conway's Life)
The glider is a pattern that travels across the board in Conway's Game of Life. It was first discovered by Richard K. Guy in 1969, while John Conway's group was attempting to track the evolution of the R-pentomino. Gliders are the smallest spaceships, and they travel diagonally at a speed of one cell every four generations, or c/4. The glider is often produced from randomly generated starting configurations. The name comes from the fact that, after two steps, the glider pattern repeats its configuration with a glide reflection symmetry. After four steps and two glide reflections, it returns to its original orientation. John Conway remarked that he wished he hadn't called it the glider. The game was developed before the widespread use of interactive computers, and after seeing it animated, he feels the glider looks more like an ant walking across the plane. Importance Gliders are important to the Game of Life because they are easily produced, can be collided with each other ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Conway's Game Of Life
The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine. Rules The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square ''cells'', each of which is in one of two possible states, ''live'' or ''dead'' (or ''populated'' and ''unpopulated'', respectively). Every cell interacts with its eight '' neighbours'', which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur: # Any live cell with fewer than two live neighbours dies, as if by underpopulation. # Any live cell with two or three live neig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Critters Block Automaton , a series of children's books by Mercer Mayer
{{disambig ...
Critter may refer to: * Critter (chess), a Slovak chess engine * Critters (cellular automaton) * ''Critters'' (comics), an anthology comic book published by Fantagraphics Books * Critters (film series) ** ''Critters'' (film), the first film in the series * Fearsome critters, legendary monsters said to live in North America * The Critters, an American pop group * The mascot and call sign of ValuJet Airlines * A fan of the popular Dungeons and Dragons series ''Critical Role'' * "The Critter", a Chinese pangolin See also * Little Critter This is a list of the works of Mercer Mayer. The following is a partial list of books that Mercer Mayer has written and/or illustrated. It also includes books and items that are related to Mercer Mayer and his creations (like coloring books, sti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Elastic Collision
In physics, an elastic collision is an encounter (collision) between two bodies in which the total kinetic energy of the two bodies remains the same. In an ideal, perfectly elastic collision, there is no net conversion of kinetic energy into other forms such as heat, noise, or potential energy. During the collision of small objects, kinetic energy is first converted to potential energy associated with a repulsive or attractive force between the particles (when the particles move against this force, i.e. the angle between the force and the relative velocity is obtuse), then this potential energy is converted back to kinetic energy (when the particles move with this force, i.e. the angle between the force and the relative velocity is acute). Collisions of atoms are elastic, for example Rutherford backscattering. A useful special case of elastic collision is when the two bodies have equal mass, in which case they will simply exchange their momenta. The ''molecules''—as dist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
