Parallel Universal Simulation and Self-Reproduction in Cellular Spaces

スポンサーリンク

概要

• 論文の詳細を見る

• This paper describes cellular spaces (or cellular automata) with capabilities of parallel self-reproduction and of parallel universal simulation of other cellular spaces. It is shown that there is a 1-dimensional cellular space U, called a parallel universal simulator, that can simulate any given 1-dimensional cellular space S in the sense that if an initial configuration of U has a coded information of both the local function and an initial configuration of S, then U has the same computation result that S has and the computation time of U is proportional to that of S. Two models of nontrivial parallel self-reproduction are also shown. One model is based on "state-exchange" method, and the other is based on a fixed point program of the parallel universal simulator.

• 社団法人電子情報通信学会の論文
• 1997-05-25

著者

• Nakamura Katsuhiko

  College Of Science And Engineering Tokyo Denki University

関連論文

• Asynchronous and Synchronous Parallel Derivation of Formal Languages
• Parallel Universal Simulation and Self-Reproduction in Cellular Spaces

スポンサーリンク