Specific Properties of the Computation Process by a Turing Machine on the Game of Life

2019 ◽  
Vol E102.A (2) ◽  
pp. 415-422
Author(s):  
Shigeru NINAGAWA
Keyword(s):  
Turing Machine ◽  
Game Of Life ◽  
Computation Process

Lifelike Self-Replicators

2010 ◽  
pp. 210-247
Author(s):  
Eleonora Bilotta ◽  
Pietro Pantano
Keyword(s):  
Cellular Automaton ◽  
Turing Machine ◽  
Digital Computer ◽  
Initial Conditions ◽  
Von Neumann ◽  
One Dimensional ◽  
Game Of Life ◽  
Universal Computation

The concept of a cellular automaton derives from John von Neumann’s studies of the logic of life. In these studies, von Neumann focused on self-replicating structures with universal computational capabilities. Given the appropriate initial conditions, a universal computer can perform any finite computation, reproducing even the most complex biological behaviors. It is well known that the ECAs described in (Wolfram, 2002) and the Game of Life (Gardner, 1970; Evans, 2003; Adachi et al., 2008) have universal computational capabilities. It has been shown, furthermore, that certain one-dimensional CAs can generate structures that are equivalent to the components of an idealized digital computer, and that, by connecting these components in different ways, it is possible to implement any kind of algorithm. In brief, these CAs are equivalent to the better known - and simpler - Turing machine and share its ability to perform universal computation (Smith 1971).

SOFTWARE PROGRAMMABLE MODULE BASED ON TURING MACHINE

2016 ◽  
Vol 21 (97) ◽  
pp. 87-91
Author(s):  
Victor A. Krisilov ◽  
◽  
Gleb E. Romanov ◽  
Nikolaj I. Sinegub ◽  
◽  
...  
Keyword(s):  
Turing Machine
Sign in / Sign up

Export Citation Format

Share Document