このエントリーをはてなブックマークに追加
ID 48449
file
creator
Harao, Masateru
subject
reversible computing
cellular automata
computational universality
abstract
A reversible cellular automaton (CA) is a "backward deterministic" CA, i.e, every configuration of it has at most one predecessor. Toffoli showed that a two-dimensional reversible cellular automaton is computation universal. He posed an open problem whether a one-dimensional reversible CA is computation universal. In this paper, we solve this problem affirmatively. This result is proved by using the previous result of Morita et al. that a 1-tape reversible Turing machine is computation universal. We give a construction method of a reversible CA which simulates a given 1-tape reversible Turing machine. To do this, we introduce a "one-dimensional partitioned cellular automaton" (1-PCA). 1-PCA has the property that the local reversibility (i.e., injectivity of a local function) is equivalent to the global reversibility, and thus it facilitates to design a reversible CA.
journal title
The Transactions of the IEICE
volume
Volume E72
issue
Issue 6
start page
758
end page
762
date of issued
1989-06-25
publisher
電子情報通信学会
issn
0913-574X
ncid
language
eng
nii type
Journal Article
HU type
Journal Articles
DCMI type
text
format
application/pdf
text version
publisher
rights
Copyright (c) 1989 IEICE
relation url
department
Graduate School of Engineering