|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-319-19842-2 |
003 |
DE-He213 |
005 |
20220115023845.0 |
007 |
cr nn 008mamaa |
008 |
150721s2016 sz | s |||| 0|eng d |
020 |
|
|
|a 9783319198422
|9 978-3-319-19842-2
|
024 |
7 |
|
|a 10.1007/978-3-319-19842-2
|2 doi
|
050 |
|
4 |
|a TA352-356
|
050 |
|
4 |
|a QC20.7.N6
|
072 |
|
7 |
|a TBJ
|2 bicssc
|
072 |
|
7 |
|a GPFC
|2 bicssc
|
072 |
|
7 |
|a TEC009000
|2 bisacsh
|
072 |
|
7 |
|a TBJ
|2 thema
|
072 |
|
7 |
|a GPFC
|2 thema
|
082 |
0 |
4 |
|a 515.39
|2 23
|
100 |
1 |
|
|a Rendell, Paul.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
245 |
1 |
0 |
|a Turing Machine Universality of the Game of Life
|h [electronic resource] /
|c by Paul Rendell.
|
250 |
|
|
|a 1st ed. 2016.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2016.
|
300 |
|
|
|a XV, 177 p. 141 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Emergence, Complexity and Computation,
|x 2194-7295 ;
|v 18
|
505 |
0 |
|
|a Introduction -- 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 |
|
|
|a This 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 |
|a Dynamics.
|
650 |
|
0 |
|a Nonlinear theories.
|
650 |
|
0 |
|a Computational intelligence.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Nonlinear Optics.
|
650 |
1 |
4 |
|a Applied Dynamical Systems.
|
650 |
2 |
4 |
|a Computational Intelligence.
|
650 |
2 |
4 |
|a Artificial Intelligence.
|
650 |
2 |
4 |
|a Nonlinear Optics.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319198415
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319198439
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319370446
|
830 |
|
0 |
|a Emergence, Complexity and Computation,
|x 2194-7295 ;
|v 18
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-319-19842-2
|z Texto Completo
|
912 |
|
|
|a ZDB-2-ENG
|
912 |
|
|
|a ZDB-2-SXE
|
950 |
|
|
|a Engineering (SpringerNature-11647)
|
950 |
|
|
|a Engineering (R0) (SpringerNature-43712)
|