Wiktionary英語版

出典：Wiktionary

elementary cellular automaton

名詞

elementary cellular automaton (複数形 elementary cellular automata または elementary cellular automatons)

  1. (cellular automata) A one-dimensional, two-state cellular automaton in which a cell's state in the next generation depends only on its current state and the states of its two immediate neighbours.

参考

調べた例文を記録して、効率よく覚えましょう
Weblio会員無料で登録できます
履歴機能 過去に調べた単語を確認できる
語彙力診断 診断回数が4回に増加
マイ単語帳 便利な学習機能付き
マイ例文帳 文章で意味を理解できる
Weblio会員登録(無料)はこちらから▶

ウィキペディア英語版

出典：Wikipedia

Elementary cellular automaton

出典:『Wikipedia』 (2011/05/07 03:14 UTC 版)

英語による解説

ウィキペディア英語版からの引用
引用

In mathematics and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and 1) and the rule to determine the state of a cell in the next generation depends only on the current state of the cell and its two immediate neighbors. As such it is one of the simplest possible models of computation. Nevertheless, there is an elementary cellular automaton (rule 110, defined below) which is capable of universal computation.

elementary cellular automatonのページの著作権