Pattern - Revision history

Confocal: formatting

2022-12-29T23:40:35Z

formatting

← Older revision		Revision as of 23:40, 29 December 2022
Line 16:		Line 16:

	==See also==		==See also==
	*[[Evolution]]		* [[Evolution]]
	*~~[[:Category:~~Patterns~~\|List of patterns]]~~		* {{CategoryLink\|Patterns}}

	__NOTOC__		__NOTOC__

Ian07: /* See also */added NOTOC using AutoWikiBrowser

2022-01-04T21:33:37Z

See also: added NOTOC using AutoWikiBrowser

← Older revision		Revision as of 21:33, 4 January 2022
Line 18:		Line 18:
	*[[Evolution]]		*[[Evolution]]
	*[[:Category:Patterns\|List of patterns]]		*[[:Category:Patterns\|List of patterns]]

			__NOTOC__

GUYTU6J: Undo revision by ColorfulGalaxy: there is no point in linking to these particular threads

2021-09-15T11:04:49Z

Undo revision by ColorfulGalaxy: there is no point in linking to these particular threads

← Older revision		Revision as of 11:04, 15 September 2021
Line 1:		Line 1:
	{{Glossary}}		{{Glossary}}
	In a [[cellular automaton]], a '''pattern''' is any particular configuration of [[cell]]s covering the infinite plane ~~(or [[Lattice\|other backdrop]])~~ that the automaton operates on.		In a [[cellular automaton]], a '''pattern''' is any particular configuration of [[cell]]s covering the infinite plane that the automaton operates on.

	==Finiteness==		==Finiteness==
Line 13:		Line 13:

	==Interestingness==		==Interestingness==
	Patterns are usually only considered interesting if they evolve in special ways. Certain families of patterns of interest include [[oscillator~~\|oscillators~~]] and [[spaceship]]s.		Patterns are usually only considered interesting if they evolve in special ways. Certain families of patterns of interest include [[oscillator]]s and [[spaceship]]s.

	==See also==		==See also==
			*[[Evolution]]
	*[[:Category:Patterns\|List of patterns]]		*[[:Category:Patterns\|List of patterns]]

	~~==External links==~~
	* {{LinkForumThread\|f=2\|t=576\|title=General patterns}}
	* {{LinkForumThread\|f=12\|t=3316\|title=Showcasing patterns}}
	* {{LinkForumThread\|f=12\|t=2589\|title=Random patterns}}

ColorfulGalaxy: Added three forum links

2021-03-21T07:46:37Z

Added three forum links

← Older revision		Revision as of 07:46, 21 March 2021
Line 17:		Line 17:
	==See also==		==See also==
	*[[:Category:Patterns\|List of patterns]]		*[[:Category:Patterns\|List of patterns]]

			==External links==
			* {{LinkForumThread\|f=2\|t=576\|title=General patterns}}
			* {{LinkForumThread\|f=12\|t=3316\|title=Showcasing patterns}}
			* {{LinkForumThread\|f=12\|t=2589\|title=Random patterns}}

Apple Bottom: /* Interestingness */

2018-02-25T14:41:30Z

Interestingness

← Older revision		Revision as of 14:41, 25 February 2018
Line 13:		Line 13:

	==Interestingness==		==Interestingness==
	Patterns are usually only considered interesting if they evolve in special ways. Certain families of patterns of interest include [[oscillator\|oscillators]] and [[~~spaceships~~]].		Patterns are usually only considered interesting if they evolve in special ways. Certain families of patterns of interest include [[oscillator\|oscillators]] and [[spaceship]]s.

	~~For a [[field]] '''F''' = {1, 2, 3}<sup>2</sup> with 2 states, there are 2<sup>18</sup> = 262,144 different patterns. With the addition of another state, there are 134,217,728 different patterns~~.

	==See also==		==See also==
	*[[:Category:Patterns\|List of patterns]]		*[[:Category:Patterns\|List of patterns]]

Apple Bottom: disambig

2018-01-25T16:59:10Z

disambig

← Older revision		Revision as of 16:59, 25 January 2018
Line 3:		Line 3:

	==Finiteness==		==Finiteness==
	Only those patterns that have finite complexity can be studied. Most typically this is accomplished by establishing a [[vacuum]]: requiring the existence of a cell type that, in a neighborhood of no other cells, will remain the same type. A '''finite pattern''', then, is a pattern where infinitely many cells are in the vacuum state, and a finite number in all other states. The vacuum state cells will be known as '''dead cells''', all others as '''live cells''', or "plain" cells.		Only those patterns that have finite complexity can be studied. Most typically this is accomplished by establishing a [[vacuum (empty space)\|vacuum]]: requiring the existence of a cell type that, in a neighborhood of no other cells, will remain the same type. A '''finite pattern''', then, is a pattern where infinitely many cells are in the vacuum state, and a finite number in all other states. The vacuum state cells will be known as '''dead cells''', all others as '''live cells''', or "plain" cells.

	A [[bounding box]] can be defined for any finite pattern, as the smallest rectangular area that contains all the live cells of a pattern. By definition, all cells outside the bounding box are dead, and a simple finite description of a pattern is to enumerate the state of each cell within the bounding box.		A [[bounding box]] can be defined for any finite pattern, as the smallest rectangular area that contains all the live cells of a pattern. By definition, all cells outside the bounding box are dead, and a simple finite description of a pattern is to enumerate the state of each cell within the bounding box.

Deleted User at 00:04, 30 May 2017

2017-05-30T00:04:59Z

← Older revision		Revision as of 00:04, 30 May 2017
Line 3:		Line 3:

	==Finiteness==		==Finiteness==
	Only those patterns that have finite complexity can be studied. Most typically this is ~~accomplishd~~ by establishing a [[vacuum]]: requiring the existence of a cell type that, in a neighborhood of no other cells, will remain the same type. A '''finite pattern''', then, is a pattern where infinitely many cells are in the vacuum state, and a finite number in all other states. The vacuum state cells will be known as '''dead cells''', all others as '''live cells''', or "plain" cells.		Only those patterns that have finite complexity can be studied. Most typically this is accomplished by establishing a [[vacuum]]: requiring the existence of a cell type that, in a neighborhood of no other cells, will remain the same type. A '''finite pattern''', then, is a pattern where infinitely many cells are in the vacuum state, and a finite number in all other states. The vacuum state cells will be known as '''dead cells''', all others as '''live cells''', or "plain" cells.

	A [[bounding box]] can be defined for any finite pattern, as the smallest rectangular area that contains all the live cells of a pattern. By definition, all cells outside the bounding box are dead, and a simple finite description of a pattern is to enumerate the state of each cell within the bounding box.		A [[bounding box]] can be defined for any finite pattern, as the smallest rectangular area that contains all the live cells of a pattern. By definition, all cells outside the bounding box are dead, and a simple finite description of a pattern is to enumerate the state of each cell within the bounding box.

Apple Bottom at 21:03, 12 May 2016

2016-05-12T21:03:14Z

← Older revision		Revision as of 21:03, 12 May 2016
Line 16:		Line 16:

	For a [[field]] '''F''' = {1, 2, 3}<sup>2</sup> with 2 states, there are 2<sup>18</sup> = 262,144 different patterns. With the addition of another state, there are 134,217,728 different patterns.		For a [[field]] '''F''' = {1, 2, 3}<sup>2</sup> with 2 states, there are 2<sup>18</sup> = 262,144 different patterns. With the addition of another state, there are 134,217,728 different patterns.

	==See also==		==See also==
	*[[:Category:Patterns\|List of patterns]]		*[[:Category:Patterns\|List of patterns]]

Tropylium: expanded

2014-11-25T20:48:28Z

expanded

@@ Line 1: / Line 1: @@
 {{Glossary}}
-A '''pattern''' is any configuration of alive and dead [[cell]]s. The number of alive cells is usually finite, and patterns are usually only considered interesting if they evolve in special ways. Certain families of patterns of interest include [[oscillator|oscillators]] and [[spaceships]].
+In a [[cellular automaton]], a '''pattern''' is any particular configuration of [[cell]]s covering the infinite plane (or [[Lattice|other backdrop]]) that the automaton operates on.
 For a [[field]] '''F''' = {1, 2, 3}<sup>2</sup> with 2 states, there are 2<sup>18</sup> = 262,144 different patterns. With the addition of another state, there are 134,217,728 different patterns.
 ==See also==
 *[[:Category:Patterns|List of patterns]]

Codeholic: reverted to an older version

2014-02-28T16:04:21Z

reverted to an older version

@@ Line 5: / Line 5: @@
 ==See also==
 *[[:Category:Patterns|List of patterns]]
-BLINKcell.mc
 {{stub}}