このエントリーをはてなブックマークに追加
ID 39997
本文ファイル
著者
Morita, Kenichi
NDC
電気工学
抄録(英)
Eight-state isotropic triangular partitioned cellular automata (TPCAs) are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. Among them, we study computational universality of reversible and conservative ETPCAs. There are nine kinds of such ETPCAs. We show six of them are universal, and three are non-universal. Universality is shown by giving a configuration that simulates a Fredkin gate, a universal reversible gate. Computer simulation results are also given as movies and in the attachment files.
内容記述
This work was supported by JSPS KAKENHI Grant Number 15K00019
作成年月日
2016-05
言語
英語
NII資源タイプ
データ・データベース
広大資料タイプ
データセット
DCMIタイプ
text
フォーマット
application/pdf
著者版フラグ
author
部局名
工学研究科