000 | 03161nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-319-19842-2 | ||
003 | DE-He213 | ||
005 | 20220801221905.0 | ||
007 | cr nn 008mamaa | ||
008 | 150721s2016 sz | s |||| 0|eng d | ||
020 |
_a9783319198422 _9978-3-319-19842-2 |
||
024 | 7 |
_a10.1007/978-3-319-19842-2 _2doi |
|
050 | 4 | _aTA352-356 | |
050 | 4 | _aQC20.7.N6 | |
072 | 7 |
_aTBJ _2bicssc |
|
072 | 7 |
_aGPFC _2bicssc |
|
072 | 7 |
_aTEC009000 _2bisacsh |
|
072 | 7 |
_aTBJ _2thema |
|
072 | 7 |
_aGPFC _2thema |
|
082 | 0 | 4 |
_a515.39 _223 |
100 | 1 |
_aRendell, Paul. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut _958559 |
|
245 | 1 | 0 |
_aTuring Machine Universality of the Game of Life _h[electronic resource] / _cby Paul Rendell. |
250 | _a1st ed. 2016. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2016. |
|
300 |
_aXV, 177 p. 141 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aEmergence, Complexity and Computation, _x2194-7295 ; _v18 |
|
505 | 0 | _aIntroduction -- Background -- Literature Review / Related Work -- Game of Life Turing Machine -- Game of Life Universal Turing Machine -- Optimizing Transition Order -- Forty Five Degree Stack -- Stack Constructor -- Universal Counter Machine - Turing Machine -- Wolfram’s two State Three Symbol UTM -- Conclusions and Discussion -- Further Work. | |
520 | _aThis book presents a proof of universal computation in the Game of Life cellular automaton by using a Turing machine construction. It provides an introduction including background information and an extended review of the literature for Turing Machines, Counter Machines and the relevant patterns in Conway's Game of Life so that the subject matter is accessibly to non specialists. The book contains a description of the author’s Turing machine in Conway’s Game of Life including an unlimited storage tape provided by growing stack structures and it also presents a fast universal Turing machine designed to allow the working to be demonstrated in a convenient period of time. . | ||
650 | 0 |
_aDynamics. _958560 |
|
650 | 0 |
_aNonlinear theories. _93339 |
|
650 | 0 |
_aComputational intelligence. _97716 |
|
650 | 0 |
_aArtificial intelligence. _93407 |
|
650 | 0 |
_aNonlinear Optics. _911414 |
|
650 | 1 | 4 |
_aApplied Dynamical Systems. _932005 |
650 | 2 | 4 |
_aComputational Intelligence. _97716 |
650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
650 | 2 | 4 |
_aNonlinear Optics. _911414 |
710 | 2 |
_aSpringerLink (Online service) _958561 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783319198415 |
776 | 0 | 8 |
_iPrinted edition: _z9783319198439 |
776 | 0 | 8 |
_iPrinted edition: _z9783319370446 |
830 | 0 |
_aEmergence, Complexity and Computation, _x2194-7295 ; _v18 _958562 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-319-19842-2 |
912 | _aZDB-2-ENG | ||
912 | _aZDB-2-SXE | ||
942 | _cEBK | ||
999 |
_c80166 _d80166 |