Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5195996> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Q5195996 subject Q7036021.
- Q5195996 subject Q8266681.
- Q5195996 subject Q8839314.
- Q5195996 subject Q8870081.
- Q5195996 abstract "The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton L. Curtis, Gustav A. Hedlund, and Roger Lyndon; in his 1969 paper stating the theorem, Hedlund credited Curtis and Lyndon as co-discoverers. It has been called "one of the fundamental results in symbolic dynamics".The theorem states that a function from a shift space to itself represents the transition function of a one-dimensional cellular automaton if and only if it is continuous (with respect to the Cantor topology) and equivariant (with respect to the shift map). More generally, it asserts that the morphisms between any two shift spaces (i.e., continuous mappings that commute with the shift) are exactly those mappings which can be defined uniformly by a local rule.The version of the theorem in Hedlund's paper applied only to one-dimensional finite automata, but a generalization to higher dimensional integer lattices was soon afterwards published by Richardson (1972), and it can be even further generalized from lattices to discrete groups. One important consequence of the theorem is that, for reversible cellular automata, the reverse dynamics of the automaton can also be described by a cellular automaton.".
- Q5195996 wikiPageWikiLink Q10642901.
- Q5195996 wikiPageWikiLink Q11348.
- Q5195996 wikiPageWikiLink Q1137014.
- Q5195996 wikiPageWikiLink Q12503.
- Q5195996 wikiPageWikiLink Q1252145.
- Q5195996 wikiPageWikiLink Q1303310.
- Q5195996 wikiPageWikiLink Q133250.
- Q5195996 wikiPageWikiLink Q1350838.
- Q5195996 wikiPageWikiLink Q1361055.
- Q5195996 wikiPageWikiLink Q1555939.
- Q5195996 wikiPageWikiLink Q170058.
- Q5195996 wikiPageWikiLink Q179899.
- Q5195996 wikiPageWikiLink Q189156.
- Q5195996 wikiPageWikiLink Q1948412.
- Q5195996 wikiPageWikiLink Q2278680.
- Q5195996 wikiPageWikiLink Q256355.
- Q5195996 wikiPageWikiLink Q288465.
- Q5195996 wikiPageWikiLink Q2937829.
- Q5195996 wikiPageWikiLink Q331481.
- Q5195996 wikiPageWikiLink Q3439226.
- Q5195996 wikiPageWikiLink Q381892.
- Q5195996 wikiPageWikiLink Q616653.
- Q5195996 wikiPageWikiLink Q7036021.
- Q5195996 wikiPageWikiLink Q7318293.
- Q5195996 wikiPageWikiLink Q7496253.
- Q5195996 wikiPageWikiLink Q7646415.
- Q5195996 wikiPageWikiLink Q8266681.
- Q5195996 wikiPageWikiLink Q837518.
- Q5195996 wikiPageWikiLink Q8839314.
- Q5195996 wikiPageWikiLink Q8870081.
- Q5195996 comment "The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton L. Curtis, Gustav A. Hedlund, and Roger Lyndon; in his 1969 paper stating the theorem, Hedlund credited Curtis and Lyndon as co-discoverers.".
- Q5195996 label "Curtis–Hedlund–Lyndon theorem".