大葉大學圖書館 |

Turing machine universality of the game of life[electronic resource] /

Record Type:	Language materials, printed : Monograph/item
[NT 15000414]:	511.352
Title/Author:	Turing machine universality of the game of life/ by Paul Rendell.
Author:	Rendell, Paul.
Published:	Cham : : Springer International Publishing :, 2016.
Description:	xv, 177 p. : : ill., digital ;; 24 cm.
Contained By:	Springer eBooks
Subject:	Turing machines.
Subject:	Pattern recognition systems.
Subject:	Engineering.
Subject:	Complexity.
Subject:	Computational Intelligence.
Subject:	Artificial Intelligence (incl. Robotics)
Subject:	Nonlinear Dynamics.
ISBN:	9783319198422
ISBN:	9783319198415
[NT 15000228]:	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.
[NT 15000229]:	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.
Online resource:	http://dx.doi.org/10.1007/978-3-319-19842-2

Turing machine universality of the game of life[electronic resource] /
Rendell, Paul.

Turing machine universality of the game of life[electronic resource] /by Paul Rendell. - Cham :Springer International Publishing :2016. - xv, 177 p. :ill., digital ;24 cm. - Emergence, complexity and computation,v.182194-7287 ;. - Emergence, complexity and computation ;v.10..

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.

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.

ISBN: 9783319198422

Standard No.: 10.1007/978-3-319-19842-2doiSubjects--Personal Names:

651642
Conway, John H.
Game of life.Subjects--Topical Terms:

651643
Turing machines.

LC Class. No.: QA267

Dewey Class. No.: 511.352

Turing machine universality of the game of life[electronic resource] /
LDR:02005nam a2200325 a 4500 001 454292
003 DE-He213
005 20160713090932.0
006 m d
007 cr nn 008maaau
008 161227s2016 gw s 0 eng d
020 $a 9783319198422 $q (electronic bk.)
020 $a 9783319198415 $q (paper)
024 7 $a 10.1007/978-3-319-19842-2 $2 doi
035 $a 978-3-319-19842-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267
072 7 $a GPFC $2 bicssc
072 7 $a TEC000000 $2 bisacsh
082 0 4 $a 511.352 $2 23
090 $a QA267 $b .R397 2016
100 1 $a Rendell, Paul. $3 651641
245 1 0 $a Turing machine universality of the game of life $h [electronic resource] / $c by Paul Rendell.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xv, 177 p. : $b ill., digital ; $c 24 cm.
490 1 $a Emergence, complexity and computation, $x 2194-7287 ; $v 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.
600 1 0 $a Conway, John H. $q (John Horton). $t Game of life. $3 651642
650 0 $a Turing machines. $3 651643
650 0 $a Pattern recognition systems. $3 189561
650 1 4 $a Engineering. $3 372756
650 2 4 $a Complexity. $3 464233
650 2 4 $a Computational Intelligence. $3 463962
650 2 4 $a Artificial Intelligence (incl. Robotics) $3 463642
650 2 4 $a Nonlinear Dynamics. $3 428109
710 2 $a SpringerLink (Online service) $3 463450
773 0 $t Springer eBooks
830 0 $a Emergence, complexity and computation ; $v v.10. $3 589012
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-19842-2
950 $a Engineering (Springer-11647)