Discrete systems with memory /:
Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems,...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Singapore ; Hackensack, N.J. :
World Scientific,
©2011.
|
| Series: | World Scientific series on nonlinear science. Monographs and treatises ;
v. 75. |
| Subjects: | |
| Online Access: | DE-862 DE-863 |
| Summary: | Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connected finite state machines, or cells, update their states simultaneously, in discrete time, by the same transition rule. The classical dynamics in these systems is Markovian : only the actual configuration is taken into account to generate the next one. Generalizing the conventional view on spatially extended discrete dynamical systems evolution by allowing cells (or nodes) to be featured by some trait state computed as a function of its own previous state-values, the transition maps of the classical systems are kept unaltered, so that the effect of memory can be easily traced. The book demonstrates that discrete dynamical systems with memory are not only priceless tools for modeling natural phenomena but unique mathematical and aesthetic objects. |
| Physical Description: | 1 online resource (xi, 465 pages) : illustrations, plates (some color) |
| Bibliography: | Includes bibliographical references (pages 429-450) and index. |
| ISBN: | 9789814343640 9814343641 1283235021 9781283235020 9786613235022 6613235024 |
Staff View
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn756782478 | ||
| 003 | OCoLC | ||
| 005 | 20250103110447.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 111012s2011 si af obd 001 0 eng d | ||
| 010 | |z 2011282500 | ||
| 040 | |a N$T |b eng |e pn |c N$T |d E7B |d CUY |d YDXCP |d UIU |d OCLCQ |d DEBSZ |d OCLCQ |d OCLCA |d OCLCQ |d NLGGC |d OCLCQ |d OCLCF |d OCLCQ |d AZK |d LOA |d JBG |d AGLDB |d OCLCQ |d U3W |d STF |d WRM |d OCLCQ |d VTS |d COCUF |d INT |d VT2 |d OCLCQ |d WYU |d ICG |d TKN |d OCLCQ |d UKAHL |d LEAUB |d AU@ |d UKCRE |d VLY |d OCLCQ |d OCLCO |d SFB |d OCLCO |d OCLCQ |d INARC |d OCLCO |d OCLCL |d SXB |d OCLCQ | ||
| 019 | |a 792930944 |a 961548892 |a 962639811 |a 966111468 |a 988479717 |a 992005258 |a 1037747764 |a 1038648938 |a 1045493445 |a 1055316829 |a 1058331290 |a 1063816627 |a 1077275066 |a 1081293676 |a 1086507739 |a 1153499874 |a 1162023280 |a 1228532779 |a 1241874574 |a 1290101025 |a 1300695300 |a 1391408150 | ||
| 020 | |a 9789814343640 |q (electronic bk.) | ||
| 020 | |a 9814343641 |q (electronic bk.) | ||
| 020 | |a 1283235021 | ||
| 020 | |a 9781283235020 | ||
| 020 | |a 9786613235022 | ||
| 020 | |a 6613235024 | ||
| 020 | |z 9814343633 | ||
| 020 | |z 9789814343633 | ||
| 035 | |a (OCoLC)756782478 |z (OCoLC)792930944 |z (OCoLC)961548892 |z (OCoLC)962639811 |z (OCoLC)966111468 |z (OCoLC)988479717 |z (OCoLC)992005258 |z (OCoLC)1037747764 |z (OCoLC)1038648938 |z (OCoLC)1045493445 |z (OCoLC)1055316829 |z (OCoLC)1058331290 |z (OCoLC)1063816627 |z (OCoLC)1077275066 |z (OCoLC)1081293676 |z (OCoLC)1086507739 |z (OCoLC)1153499874 |z (OCoLC)1162023280 |z (OCoLC)1228532779 |z (OCoLC)1241874574 |z (OCoLC)1290101025 |z (OCoLC)1300695300 |z (OCoLC)1391408150 | ||
| 050 | 4 | |a QA267.5.C45 |b A46 2011eb | |
| 072 | 7 | |a COM |x 037000 |2 bisacsh | |
| 082 | 7 | |a 511.3/5 |2 23 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Alonso-Sanz, Ramon. | |
| 245 | 1 | 0 | |a Discrete systems with memory / |c Ramon Alonso-Sanz. |
| 260 | |a Singapore ; |a Hackensack, N.J. : |b World Scientific, |c ©2011. | ||
| 300 | |a 1 online resource (xi, 465 pages) : |b illustrations, plates (some color) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file | ||
| 490 | 1 | |a World Scientific series on nonlinear science. | |
| 504 | |a Includes bibliographical references (pages 429-450) and index. |b 448 | ||
| 505 | 0 | 0 | |g Machine generated contents note: |g 1. |t Cellular Automata and memory -- |g 1.1. |t Cellular Automata -- |g 1.2. |t Memory -- |t Disclaimer -- |g 2. |t Average type memory -- |g 2.1. |t Average memory -- |g 2.2. |t Two-dimensional lattices -- |g 2.2.1. |t Totalistic rules -- |g 2.2.2. |t LIFE -- |g 2.3. |t One-dimensional layers -- |g 2.3.1. |t Elementary rules -- |g 2.3.2. |t Nearest and next-nearest neighbors -- |g 3. |t Other memories -- |g 3.1. |t Average-like memory -- |g 3.2. |t Limited trailing memory -- |g 3.3. |t Majority of the last three state memory -- |g 3.4. |t Elementary rules as memory -- |g 3.5. |t Minimal memory -- |g 4. |t Asynchrony and probabilistic rules -- |g 4.1. |t Asynchrony -- |g 4.2. |t Probabilistic rules -- |g 5. |t Cycles and random sequences -- |g 5.1. |t Cycles -- |g 5.2. |t Random number generation by CA -- |g 6. |t Three state automata -- |g 6.1. |t Totalistic rules -- |g 6.2. |t Excitable systems -- |g 7. |t Reversible dynamics -- |g 7.1. |t Characterization -- |g 7.2. |t Reversible rules with memory -- |g 8. |t Block cellular automata -- |g 8.1. |t Characterization -- |g 8.2. |t Density classification task. |
| 505 | 0 | 0 | |g 9. |t Structurally dynamic systems -- |g 9.1. |t Introduction -- |g 9.1.1. |t Reversible SDCA -- |g 9.2. |t SDCA with memory -- |g 9.2.1. |t Two state SDCA with memory -- |g 9.2.2. |t Three state SDCA -- |g 10. |t Boolean networks -- |g 10.1. |t Automata on networks -- |g 10.2. |t Boolean networks -- |g 10.3. |t Automata on proximity graphs -- |g 11. |t Coupled layers -- |g 11.1. |t Coupled cellular automata -- |g 11.2. |t Coupled Boolean networks -- |g 12. |t Continuous state variable -- |g 12.1. |t Continuous-valued automata -- |g 12.2. |t Finite difference equations -- |g 12.2.1. |t One-dimensional maps -- |g 12.2.2. |t Two-dimensional maps -- |g 12.3. |t Plane curves -- |g 12.4. |t Stochastic processes -- |g 13. |t Spatial games -- |g 13.1. |t The prisoner's dilemma -- |g 13.2. |t Degrees of cooperation and strategies -- |g 13.3. |t The structurally dynamic PD (SDPD) -- |g 13.4. |t Pavlov versus anti-Pavlov (PAP) in the PD -- |g 13.5. |t Other spatial games -- |t Appendices -- |g Appendix |t A Average memory starting at random -- |g Appendix B |t Dynamic with short-term memory -- |g Appendix C |t Heterogeneous and coupled networks -- |g Appendix D |t Continuous state variable -- |g Appendix E |t Spatial games. |
| 520 | |a Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connected finite state machines, or cells, update their states simultaneously, in discrete time, by the same transition rule. The classical dynamics in these systems is Markovian : only the actual configuration is taken into account to generate the next one. Generalizing the conventional view on spatially extended discrete dynamical systems evolution by allowing cells (or nodes) to be featured by some trait state computed as a function of its own previous state-values, the transition maps of the classical systems are kept unaltered, so that the effect of memory can be easily traced. The book demonstrates that discrete dynamical systems with memory are not only priceless tools for modeling natural phenomena but unique mathematical and aesthetic objects. | ||
| 588 | 0 | |a Print version record. | |
| 546 | |a English. | ||
| 650 | 0 | |a Cellular automata |x Mathematical models. | |
| 650 | 0 | |a Discrete-time systems |x Mathematical models. | |
| 650 | 0 | |a Dynamics. |0 http://id.loc.gov/authorities/subjects/sh85040316 | |
| 650 | 6 | |a Automates cellulaires |x Modèles mathématiques. | |
| 650 | 6 | |a Systèmes échantillonnés |x Modèles mathématiques. | |
| 650 | 6 | |a Dynamique. | |
| 650 | 7 | |a kinetics (dynamics) |2 aat | |
| 650 | 7 | |a COMPUTERS |x Machine Theory. |2 bisacsh | |
| 650 | 7 | |a Cellular automata |x Mathematical models |2 fast | |
| 650 | 7 | |a Discrete-time systems |x Mathematical models |2 fast | |
| 650 | 7 | |a Dynamics |2 fast | |
| 776 | 0 | 8 | |i Print version: |a Alonso-Sanz, Ramon. |t Discrete systems with memory. |d Singapore ; Hackensack, N.J. : World Scientific, ©2011 |z 9814343633 |w (OCoLC)694395036 |
| 830 | 0 | |a World Scientific series on nonlinear science. |n Series A, |p Monographs and treatises ; |v v. 75. |0 http://id.loc.gov/authorities/names/no94008495 | |
| 966 | 4 | 0 | |l DE-862 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=389645 |3 Volltext |
| 966 | 4 | 0 | |l DE-863 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=389645 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH25565338 | ||
| 938 | |a ebrary |b EBRY |n ebr10493544 | ||
| 938 | |a EBSCOhost |b EBSC |n 389645 | ||
| 938 | |a YBP Library Services |b YANK |n 7135086 | ||
| 938 | |a Internet Archive |b INAR |n discretesystemsw0075alon | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-862 | ||
| 049 | |a DE-863 | ||
Record in the Search Index
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn756782478 |
|---|---|
| _version_ | 1829094707877117952 |
| adam_text | |
| any_adam_object | |
| author | Alonso-Sanz, Ramon |
| author_facet | Alonso-Sanz, Ramon |
| author_role | |
| author_sort | Alonso-Sanz, Ramon |
| author_variant | r a s ras |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.5.C45 A46 2011eb |
| callnumber-search | QA267.5.C45 A46 2011eb |
| callnumber-sort | QA 3267.5 C45 A46 42011EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Cellular Automata and memory -- Cellular Automata -- Memory -- Disclaimer -- Average type memory -- Average memory -- Two-dimensional lattices -- Totalistic rules -- LIFE -- One-dimensional layers -- Elementary rules -- Nearest and next-nearest neighbors -- Other memories -- Average-like memory -- Limited trailing memory -- Majority of the last three state memory -- Elementary rules as memory -- Minimal memory -- Asynchrony and probabilistic rules -- Asynchrony -- Probabilistic rules -- Cycles and random sequences -- Cycles -- Random number generation by CA -- Three state automata -- Excitable systems -- Reversible dynamics -- Characterization -- Reversible rules with memory -- Block cellular automata -- Density classification task. Structurally dynamic systems -- Introduction -- Reversible SDCA -- SDCA with memory -- Two state SDCA with memory -- Three state SDCA -- Boolean networks -- Automata on networks -- Automata on proximity graphs -- Coupled layers -- Coupled cellular automata -- Coupled Boolean networks -- Continuous state variable -- Continuous-valued automata -- Finite difference equations -- One-dimensional maps -- Two-dimensional maps -- Plane curves -- Stochastic processes -- Spatial games -- The prisoner's dilemma -- Degrees of cooperation and strategies -- The structurally dynamic PD (SDPD) -- Pavlov versus anti-Pavlov (PAP) in the PD -- Other spatial games -- Appendices -- A Average memory starting at random -- Dynamic with short-term memory -- Heterogeneous and coupled networks -- Spatial games. |
| ctrlnum | (OCoLC)756782478 |
| dewey-full | 511.3/5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/5 |
| dewey-search | 511.3/5 |
| dewey-sort | 3511.3 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06965cam a2200709 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn756782478</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20250103110447.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">111012s2011 si af obd 001 0 eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="z"> 2011282500</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">E7B</subfield><subfield code="d">CUY</subfield><subfield code="d">YDXCP</subfield><subfield code="d">UIU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">LOA</subfield><subfield code="d">JBG</subfield><subfield code="d">AGLDB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">COCUF</subfield><subfield code="d">INT</subfield><subfield code="d">VT2</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">ICG</subfield><subfield code="d">TKN</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKAHL</subfield><subfield code="d">LEAUB</subfield><subfield code="d">AU@</subfield><subfield code="d">UKCRE</subfield><subfield code="d">VLY</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">INARC</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">792930944</subfield><subfield code="a">961548892</subfield><subfield code="a">962639811</subfield><subfield code="a">966111468</subfield><subfield code="a">988479717</subfield><subfield code="a">992005258</subfield><subfield code="a">1037747764</subfield><subfield code="a">1038648938</subfield><subfield code="a">1045493445</subfield><subfield code="a">1055316829</subfield><subfield code="a">1058331290</subfield><subfield code="a">1063816627</subfield><subfield code="a">1077275066</subfield><subfield code="a">1081293676</subfield><subfield code="a">1086507739</subfield><subfield code="a">1153499874</subfield><subfield code="a">1162023280</subfield><subfield code="a">1228532779</subfield><subfield code="a">1241874574</subfield><subfield code="a">1290101025</subfield><subfield code="a">1300695300</subfield><subfield code="a">1391408150</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814343640</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814343641</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283235021</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283235020</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613235022</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6613235024</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9814343633</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789814343633</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)756782478</subfield><subfield code="z">(OCoLC)792930944</subfield><subfield code="z">(OCoLC)961548892</subfield><subfield code="z">(OCoLC)962639811</subfield><subfield code="z">(OCoLC)966111468</subfield><subfield code="z">(OCoLC)988479717</subfield><subfield code="z">(OCoLC)992005258</subfield><subfield code="z">(OCoLC)1037747764</subfield><subfield code="z">(OCoLC)1038648938</subfield><subfield code="z">(OCoLC)1045493445</subfield><subfield code="z">(OCoLC)1055316829</subfield><subfield code="z">(OCoLC)1058331290</subfield><subfield code="z">(OCoLC)1063816627</subfield><subfield code="z">(OCoLC)1077275066</subfield><subfield code="z">(OCoLC)1081293676</subfield><subfield code="z">(OCoLC)1086507739</subfield><subfield code="z">(OCoLC)1153499874</subfield><subfield code="z">(OCoLC)1162023280</subfield><subfield code="z">(OCoLC)1228532779</subfield><subfield code="z">(OCoLC)1241874574</subfield><subfield code="z">(OCoLC)1290101025</subfield><subfield code="z">(OCoLC)1300695300</subfield><subfield code="z">(OCoLC)1391408150</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.5.C45</subfield><subfield code="b">A46 2011eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">037000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/5</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alonso-Sanz, Ramon.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Discrete systems with memory /</subfield><subfield code="c">Ramon Alonso-Sanz.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore ;</subfield><subfield code="a">Hackensack, N.J. :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2011.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xi, 465 pages) :</subfield><subfield code="b">illustrations, plates (some color)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">World Scientific series on nonlinear science.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 429-450) and index.</subfield><subfield code="b">448</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="g">Machine generated contents note:</subfield><subfield code="g">1.</subfield><subfield code="t">Cellular Automata and memory --</subfield><subfield code="g">1.1.</subfield><subfield code="t">Cellular Automata --</subfield><subfield code="g">1.2.</subfield><subfield code="t">Memory --</subfield><subfield code="t">Disclaimer --</subfield><subfield code="g">2.</subfield><subfield code="t">Average type memory --</subfield><subfield code="g">2.1.</subfield><subfield code="t">Average memory --</subfield><subfield code="g">2.2.</subfield><subfield code="t">Two-dimensional lattices --</subfield><subfield code="g">2.2.1.</subfield><subfield code="t">Totalistic rules --</subfield><subfield code="g">2.2.2.</subfield><subfield code="t">LIFE --</subfield><subfield code="g">2.3.</subfield><subfield code="t">One-dimensional layers --</subfield><subfield code="g">2.3.1.</subfield><subfield code="t">Elementary rules --</subfield><subfield code="g">2.3.2.</subfield><subfield code="t">Nearest and next-nearest neighbors --</subfield><subfield code="g">3.</subfield><subfield code="t">Other memories --</subfield><subfield code="g">3.1.</subfield><subfield code="t">Average-like memory --</subfield><subfield code="g">3.2.</subfield><subfield code="t">Limited trailing memory --</subfield><subfield code="g">3.3.</subfield><subfield code="t">Majority of the last three state memory --</subfield><subfield code="g">3.4.</subfield><subfield code="t">Elementary rules as memory --</subfield><subfield code="g">3.5.</subfield><subfield code="t">Minimal memory --</subfield><subfield code="g">4.</subfield><subfield code="t">Asynchrony and probabilistic rules --</subfield><subfield code="g">4.1.</subfield><subfield code="t">Asynchrony --</subfield><subfield code="g">4.2.</subfield><subfield code="t">Probabilistic rules --</subfield><subfield code="g">5.</subfield><subfield code="t">Cycles and random sequences --</subfield><subfield code="g">5.1.</subfield><subfield code="t">Cycles --</subfield><subfield code="g">5.2.</subfield><subfield code="t">Random number generation by CA --</subfield><subfield code="g">6.</subfield><subfield code="t">Three state automata --</subfield><subfield code="g">6.1.</subfield><subfield code="t">Totalistic rules --</subfield><subfield code="g">6.2.</subfield><subfield code="t">Excitable systems --</subfield><subfield code="g">7.</subfield><subfield code="t">Reversible dynamics --</subfield><subfield code="g">7.1.</subfield><subfield code="t">Characterization --</subfield><subfield code="g">7.2.</subfield><subfield code="t">Reversible rules with memory --</subfield><subfield code="g">8.</subfield><subfield code="t">Block cellular automata --</subfield><subfield code="g">8.1.</subfield><subfield code="t">Characterization --</subfield><subfield code="g">8.2.</subfield><subfield code="t">Density classification task.</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="g">9.</subfield><subfield code="t">Structurally dynamic systems --</subfield><subfield code="g">9.1.</subfield><subfield code="t">Introduction --</subfield><subfield code="g">9.1.1.</subfield><subfield code="t">Reversible SDCA --</subfield><subfield code="g">9.2.</subfield><subfield code="t">SDCA with memory --</subfield><subfield code="g">9.2.1.</subfield><subfield code="t">Two state SDCA with memory --</subfield><subfield code="g">9.2.2.</subfield><subfield code="t">Three state SDCA --</subfield><subfield code="g">10.</subfield><subfield code="t">Boolean networks --</subfield><subfield code="g">10.1.</subfield><subfield code="t">Automata on networks --</subfield><subfield code="g">10.2.</subfield><subfield code="t">Boolean networks --</subfield><subfield code="g">10.3.</subfield><subfield code="t">Automata on proximity graphs --</subfield><subfield code="g">11.</subfield><subfield code="t">Coupled layers --</subfield><subfield code="g">11.1.</subfield><subfield code="t">Coupled cellular automata --</subfield><subfield code="g">11.2.</subfield><subfield code="t">Coupled Boolean networks --</subfield><subfield code="g">12.</subfield><subfield code="t">Continuous state variable --</subfield><subfield code="g">12.1.</subfield><subfield code="t">Continuous-valued automata --</subfield><subfield code="g">12.2.</subfield><subfield code="t">Finite difference equations --</subfield><subfield code="g">12.2.1.</subfield><subfield code="t">One-dimensional maps --</subfield><subfield code="g">12.2.2.</subfield><subfield code="t">Two-dimensional maps --</subfield><subfield code="g">12.3.</subfield><subfield code="t">Plane curves --</subfield><subfield code="g">12.4.</subfield><subfield code="t">Stochastic processes --</subfield><subfield code="g">13.</subfield><subfield code="t">Spatial games --</subfield><subfield code="g">13.1.</subfield><subfield code="t">The prisoner's dilemma --</subfield><subfield code="g">13.2.</subfield><subfield code="t">Degrees of cooperation and strategies --</subfield><subfield code="g">13.3.</subfield><subfield code="t">The structurally dynamic PD (SDPD) --</subfield><subfield code="g">13.4.</subfield><subfield code="t">Pavlov versus anti-Pavlov (PAP) in the PD --</subfield><subfield code="g">13.5.</subfield><subfield code="t">Other spatial games --</subfield><subfield code="t">Appendices --</subfield><subfield code="g">Appendix</subfield><subfield code="t">A Average memory starting at random --</subfield><subfield code="g">Appendix B</subfield><subfield code="t">Dynamic with short-term memory --</subfield><subfield code="g">Appendix C</subfield><subfield code="t">Heterogeneous and coupled networks --</subfield><subfield code="g">Appendix D</subfield><subfield code="t">Continuous state variable --</subfield><subfield code="g">Appendix E</subfield><subfield code="t">Spatial games.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connected finite state machines, or cells, update their states simultaneously, in discrete time, by the same transition rule. The classical dynamics in these systems is Markovian : only the actual configuration is taken into account to generate the next one. Generalizing the conventional view on spatially extended discrete dynamical systems evolution by allowing cells (or nodes) to be featured by some trait state computed as a function of its own previous state-values, the transition maps of the classical systems are kept unaltered, so that the effect of memory can be easily traced. The book demonstrates that discrete dynamical systems with memory are not only priceless tools for modeling natural phenomena but unique mathematical and aesthetic objects.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Cellular automata</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Discrete-time systems</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Dynamics.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85040316</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Automates cellulaires</subfield><subfield code="x">Modèles mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Systèmes échantillonnés</subfield><subfield code="x">Modèles mathématiques.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Dynamique.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">kinetics (dynamics)</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Machine Theory.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Cellular automata</subfield><subfield code="x">Mathematical models</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Discrete-time systems</subfield><subfield code="x">Mathematical models</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Dynamics</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Alonso-Sanz, Ramon.</subfield><subfield code="t">Discrete systems with memory.</subfield><subfield code="d">Singapore ; Hackensack, N.J. : World Scientific, ©2011</subfield><subfield code="z">9814343633</subfield><subfield code="w">(OCoLC)694395036</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">World Scientific series on nonlinear science.</subfield><subfield code="n">Series A,</subfield><subfield code="p">Monographs and treatises ;</subfield><subfield code="v">v. 75.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no94008495</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-862</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=389645</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-863</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=389645</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH25565338</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10493544</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">389645</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">7135086</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Internet Archive</subfield><subfield code="b">INAR</subfield><subfield code="n">discretesystemsw0075alon</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-862</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn756782478 |
| illustrated | Illustrated |
| indexdate | 2025-04-11T08:37:25Z |
| institution | BVB |
| isbn | 9789814343640 9814343641 1283235021 9781283235020 9786613235022 6613235024 |
| language | English |
| oclc_num | 756782478 |
| open_access_boolean | |
| owner | MAIN DE-862 DE-BY-FWS DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-862 DE-BY-FWS DE-863 DE-BY-FWS |
| physical | 1 online resource (xi, 465 pages) : illustrations, plates (some color) |
| psigel | ZDB-4-EBA FWS_PDA_EBA ZDB-4-EBA |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | World Scientific, |
| record_format | marc |
| series | World Scientific series on nonlinear science. Monographs and treatises ; |
| series2 | World Scientific series on nonlinear science. |
| spelling | Alonso-Sanz, Ramon. Discrete systems with memory / Ramon Alonso-Sanz. Singapore ; Hackensack, N.J. : World Scientific, ©2011. 1 online resource (xi, 465 pages) : illustrations, plates (some color) text txt rdacontent computer c rdamedia online resource cr rdacarrier data file World Scientific series on nonlinear science. Includes bibliographical references (pages 429-450) and index. 448 Machine generated contents note: 1. Cellular Automata and memory -- 1.1. Cellular Automata -- 1.2. Memory -- Disclaimer -- 2. Average type memory -- 2.1. Average memory -- 2.2. Two-dimensional lattices -- 2.2.1. Totalistic rules -- 2.2.2. LIFE -- 2.3. One-dimensional layers -- 2.3.1. Elementary rules -- 2.3.2. Nearest and next-nearest neighbors -- 3. Other memories -- 3.1. Average-like memory -- 3.2. Limited trailing memory -- 3.3. Majority of the last three state memory -- 3.4. Elementary rules as memory -- 3.5. Minimal memory -- 4. Asynchrony and probabilistic rules -- 4.1. Asynchrony -- 4.2. Probabilistic rules -- 5. Cycles and random sequences -- 5.1. Cycles -- 5.2. Random number generation by CA -- 6. Three state automata -- 6.1. Totalistic rules -- 6.2. Excitable systems -- 7. Reversible dynamics -- 7.1. Characterization -- 7.2. Reversible rules with memory -- 8. Block cellular automata -- 8.1. Characterization -- 8.2. Density classification task. 9. Structurally dynamic systems -- 9.1. Introduction -- 9.1.1. Reversible SDCA -- 9.2. SDCA with memory -- 9.2.1. Two state SDCA with memory -- 9.2.2. Three state SDCA -- 10. Boolean networks -- 10.1. Automata on networks -- 10.2. Boolean networks -- 10.3. Automata on proximity graphs -- 11. Coupled layers -- 11.1. Coupled cellular automata -- 11.2. Coupled Boolean networks -- 12. Continuous state variable -- 12.1. Continuous-valued automata -- 12.2. Finite difference equations -- 12.2.1. One-dimensional maps -- 12.2.2. Two-dimensional maps -- 12.3. Plane curves -- 12.4. Stochastic processes -- 13. Spatial games -- 13.1. The prisoner's dilemma -- 13.2. Degrees of cooperation and strategies -- 13.3. The structurally dynamic PD (SDPD) -- 13.4. Pavlov versus anti-Pavlov (PAP) in the PD -- 13.5. Other spatial games -- Appendices -- Appendix A Average memory starting at random -- Appendix B Dynamic with short-term memory -- Appendix C Heterogeneous and coupled networks -- Appendix D Continuous state variable -- Appendix E Spatial games. Memory is a universal function of organized matter. What is the mathematics of memory? How does memory affect the space-time behaviour of spatially extended systems? Does memory increase complexity? This book provides answers to these questions. It focuses on the study of spatially extended systems, i.e., cellular automata and other related discrete complex systems. Thus, arrays of locally connected finite state machines, or cells, update their states simultaneously, in discrete time, by the same transition rule. The classical dynamics in these systems is Markovian : only the actual configuration is taken into account to generate the next one. Generalizing the conventional view on spatially extended discrete dynamical systems evolution by allowing cells (or nodes) to be featured by some trait state computed as a function of its own previous state-values, the transition maps of the classical systems are kept unaltered, so that the effect of memory can be easily traced. The book demonstrates that discrete dynamical systems with memory are not only priceless tools for modeling natural phenomena but unique mathematical and aesthetic objects. Print version record. English. Cellular automata Mathematical models. Discrete-time systems Mathematical models. Dynamics. http://id.loc.gov/authorities/subjects/sh85040316 Automates cellulaires Modèles mathématiques. Systèmes échantillonnés Modèles mathématiques. Dynamique. kinetics (dynamics) aat COMPUTERS Machine Theory. bisacsh Cellular automata Mathematical models fast Discrete-time systems Mathematical models fast Dynamics fast Print version: Alonso-Sanz, Ramon. Discrete systems with memory. Singapore ; Hackensack, N.J. : World Scientific, ©2011 9814343633 (OCoLC)694395036 World Scientific series on nonlinear science. Series A, Monographs and treatises ; v. 75. http://id.loc.gov/authorities/names/no94008495 |
| spellingShingle | Alonso-Sanz, Ramon Discrete systems with memory / World Scientific series on nonlinear science. Monographs and treatises ; Cellular Automata and memory -- Cellular Automata -- Memory -- Disclaimer -- Average type memory -- Average memory -- Two-dimensional lattices -- Totalistic rules -- LIFE -- One-dimensional layers -- Elementary rules -- Nearest and next-nearest neighbors -- Other memories -- Average-like memory -- Limited trailing memory -- Majority of the last three state memory -- Elementary rules as memory -- Minimal memory -- Asynchrony and probabilistic rules -- Asynchrony -- Probabilistic rules -- Cycles and random sequences -- Cycles -- Random number generation by CA -- Three state automata -- Excitable systems -- Reversible dynamics -- Characterization -- Reversible rules with memory -- Block cellular automata -- Density classification task. Structurally dynamic systems -- Introduction -- Reversible SDCA -- SDCA with memory -- Two state SDCA with memory -- Three state SDCA -- Boolean networks -- Automata on networks -- Automata on proximity graphs -- Coupled layers -- Coupled cellular automata -- Coupled Boolean networks -- Continuous state variable -- Continuous-valued automata -- Finite difference equations -- One-dimensional maps -- Two-dimensional maps -- Plane curves -- Stochastic processes -- Spatial games -- The prisoner's dilemma -- Degrees of cooperation and strategies -- The structurally dynamic PD (SDPD) -- Pavlov versus anti-Pavlov (PAP) in the PD -- Other spatial games -- Appendices -- A Average memory starting at random -- Dynamic with short-term memory -- Heterogeneous and coupled networks -- Spatial games. Cellular automata Mathematical models. Discrete-time systems Mathematical models. Dynamics. http://id.loc.gov/authorities/subjects/sh85040316 Automates cellulaires Modèles mathématiques. Systèmes échantillonnés Modèles mathématiques. Dynamique. kinetics (dynamics) aat COMPUTERS Machine Theory. bisacsh Cellular automata Mathematical models fast Discrete-time systems Mathematical models fast Dynamics fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85040316 |
| title | Discrete systems with memory / |
| title_alt | Cellular Automata and memory -- Cellular Automata -- Memory -- Disclaimer -- Average type memory -- Average memory -- Two-dimensional lattices -- Totalistic rules -- LIFE -- One-dimensional layers -- Elementary rules -- Nearest and next-nearest neighbors -- Other memories -- Average-like memory -- Limited trailing memory -- Majority of the last three state memory -- Elementary rules as memory -- Minimal memory -- Asynchrony and probabilistic rules -- Asynchrony -- Probabilistic rules -- Cycles and random sequences -- Cycles -- Random number generation by CA -- Three state automata -- Excitable systems -- Reversible dynamics -- Characterization -- Reversible rules with memory -- Block cellular automata -- Density classification task. Structurally dynamic systems -- Introduction -- Reversible SDCA -- SDCA with memory -- Two state SDCA with memory -- Three state SDCA -- Boolean networks -- Automata on networks -- Automata on proximity graphs -- Coupled layers -- Coupled cellular automata -- Coupled Boolean networks -- Continuous state variable -- Continuous-valued automata -- Finite difference equations -- One-dimensional maps -- Two-dimensional maps -- Plane curves -- Stochastic processes -- Spatial games -- The prisoner's dilemma -- Degrees of cooperation and strategies -- The structurally dynamic PD (SDPD) -- Pavlov versus anti-Pavlov (PAP) in the PD -- Other spatial games -- Appendices -- A Average memory starting at random -- Dynamic with short-term memory -- Heterogeneous and coupled networks -- Spatial games. |
| title_auth | Discrete systems with memory / |
| title_exact_search | Discrete systems with memory / |
| title_full | Discrete systems with memory / Ramon Alonso-Sanz. |
| title_fullStr | Discrete systems with memory / Ramon Alonso-Sanz. |
| title_full_unstemmed | Discrete systems with memory / Ramon Alonso-Sanz. |
| title_short | Discrete systems with memory / |
| title_sort | discrete systems with memory |
| topic | Cellular automata Mathematical models. Discrete-time systems Mathematical models. Dynamics. http://id.loc.gov/authorities/subjects/sh85040316 Automates cellulaires Modèles mathématiques. Systèmes échantillonnés Modèles mathématiques. Dynamique. kinetics (dynamics) aat COMPUTERS Machine Theory. bisacsh Cellular automata Mathematical models fast Discrete-time systems Mathematical models fast Dynamics fast |
| topic_facet | Cellular automata Mathematical models. Discrete-time systems Mathematical models. Dynamics. Automates cellulaires Modèles mathématiques. Systèmes échantillonnés Modèles mathématiques. Dynamique. kinetics (dynamics) COMPUTERS Machine Theory. Cellular automata Mathematical models Discrete-time systems Mathematical models Dynamics |
| work_keys_str_mv | AT alonsosanzramon discretesystemswithmemory |