Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Reversible_cellular_automaton> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Reversible_cellular_automaton abstract "A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it consists of a regular grid of cells, each of which may take on one of a finite set of states, together with a rule for updating all cells simultaneously based on the states of the neighboring cells, in such a way that the state of each cell prior to an update can be determined uniquely from the updated states of all the cells. The time-reversed dynamics of a reversible cellular automaton can always be described by another cellular automaton rule, possibly on a much larger neighborhood.Several methods are known for defining cellular automata rules that are reversible; these include the block cellular automaton method, in which each update partitions the cells into blocks and applies an invertible function separately to each block, and the second-order cellular automaton method, in which the update rule combines states from two previous steps of the automaton. However, for cellular automata that are not defined by these methods, on arrays of two or more dimensions, testing reversibility is undecidable.Reversible cellular automata form a natural model of reversible computing, a technology that could lead to ultra-low-power computing devices. Quantum cellular automata, one way of performing computations using the principles of quantum mechanics, are often required to be reversible. Additionally, many problems in physical modeling, such as the motion of particles in an ideal gas or the Ising model of alignment of magnetic charges, are naturally reversible and can be simulated by reversible cellular automata.Properties related to reversibility may also be used to study cellular automata that are not reversible on their entire configuration space, but that have a subset of the configuration space as an attractor that all initially random configurations converge towards. As Stephen Wolfram writes, "once on an attractor, any system—even if it does not have reversible underlying rules—must in some sense show approximate reversibility."".
- Reversible_cellular_automaton wikiPageExternalLink Kari2005.pdf.
- Reversible_cellular_automaton wikiPageExternalLink conslaws06.pdf.
- Reversible_cellular_automaton wikiPageExternalLink 537.
- Reversible_cellular_automaton wikiPageExternalLink 01-6-1.pdf.
- Reversible_cellular_automaton wikiPageExternalLink 05-1-3.pdf.
- Reversible_cellular_automaton wikiPageID "30766907".
- Reversible_cellular_automaton wikiPageRevisionID "605290183".
- Reversible_cellular_automaton hasPhotoCollection Reversible_cellular_automaton.
- Reversible_cellular_automaton subject Category:Cellular_automata.
- Reversible_cellular_automaton type Anomaly109606527.
- Reversible_cellular_automaton type Automaton109825519.
- Reversible_cellular_automaton type CausalAgent100007347.
- Reversible_cellular_automaton type CellularAutomata.
- Reversible_cellular_automaton type LivingThing100004258.
- Reversible_cellular_automaton type Object100002684.
- Reversible_cellular_automaton type Organism100004475.
- Reversible_cellular_automaton type Person100007846.
- Reversible_cellular_automaton type PhysicalEntity100001930.
- Reversible_cellular_automaton type Whole100003553.
- Reversible_cellular_automaton type YagoLegalActor.
- Reversible_cellular_automaton type YagoLegalActorGeo.
- Reversible_cellular_automaton comment "A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it consists of a regular grid of cells, each of which may take on one of a finite set of states, together with a rule for updating all cells simultaneously based on the states of the neighboring cells, in such a way that the state of each cell prior to an update can be determined uniquely from the updated states of all the cells.".
- Reversible_cellular_automaton label "Reversible cellular automaton".
- Reversible_cellular_automaton sameAs m.0h54k9s.
- Reversible_cellular_automaton sameAs Q7318293.
- Reversible_cellular_automaton sameAs Q7318293.
- Reversible_cellular_automaton sameAs Reversible_cellular_automaton.
- Reversible_cellular_automaton wasDerivedFrom Reversible_cellular_automaton?oldid=605290183.
- Reversible_cellular_automaton isPrimaryTopicOf Reversible_cellular_automaton.