このエントリーをはてなブックマークに追加
ID 39997
file
creator
Morita, Kenichi
NDC
Electrical engineering
abstract
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.
description
This work was supported by JSPS KAKENHI Grant Number 15K00019
date of created
2016-05
language
eng
nii type
Data or Dataset
HU type
Datasets
DCMI type
text
format
application/pdf
text version
author
department
Graduate School of Engineering