The Garden-of-Eden theorem for finite configurations

Author:

Amoroso S.,Cooper G.

Abstract

In [1] Moore showed that the existence of mutually erasable configurations in a two-dimensional tessellation space is sufficient for the existence of Garden-of-Eden configurations. In [2] Myhill showed that the existence of mutually indistinguishable configurations is both necessary and sufficient for the existence of Garden-of-Eden configurations. After redefining the basic concepts with some minor changes in terminology, and after restating the main results from [l] and [2], we shall establish the equivalence between the existence of mutually erasable configurations and the existence of mutually indistinguishable configurations. This implies that the converse of Moore’s result is true as well. We then show that by limiting the universe to the set of all finite configurations of the tessellation array, both of the above conditions remain sufficient, but neither is then necessary. Finally, we establish a necessary and sufficient condition for the existence of Garden-of-Eden configurations when only finite configurations are considered.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference5 articles.

1. Edward F. Moore, Machine models of self-reproduction, Proc. Sympos. Appl. Math., vol. 14, Amer. Math. Soc., Providence, R.I., 1962, pp. 17-33.

2. The converse of Moore’s Garden-of-Eden theorem;Myhill, John;Proc. Amer. Math. Soc.,1963

3. John von Neumann, Theory of self-reproducing automata, Edited and completed by Arthur W. Burks, Univ. of Illinois Press, Urbana, 1966.

4. A completeness problem for pattern generation in tessellation automata;Yamada, H.;J. Comput. System Sci.,1970

Cited by 26 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Shift-symmetric configurations in two-dimensional cellular automata: Irreversibility, insolvability, and enumeration;Chaos: An Interdisciplinary Journal of Nonlinear Science;2019-06

2. A survey of cellular automata: types, dynamics, non-uniformity and applications;Natural Computing;2018-07-23

3. Reversible Cellular Automata;Cellular Automata;2018

4. Reversible Cellular Automata;Encyclopedia of Complexity and Systems Science;2018

5. Computability via Cellular Automata;Scientific and Technical Information Processing;2017-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3