NO PERFECT 2-STATE CELLULAR-AUTOMATA FOR DENSITY CLASSIFICATION EXISTS

被引:148
作者
LAND, M
BELEW, RK
机构
[1] Department of Computer Science and Engineering, University of California, San Diego
关键词
D O I
10.1103/PhysRevLett.74.5148
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Recently there have been many attempts to evolve one-dimensional two-state cellular automata which classify binary strings according to their densities of 1's and 0's. The current best-known approaches involve particle-based systems of information transfer. A proof is given that there does not exist a two-state cellular automata which performs the task perfectly. This is true even in multiple dimensions. © 1995 The American Physical Society.
引用
收藏
页码:5148 / 5150
页数:3
相关论文
共 7 条
[1]  
[Anonymous], COMMUNICATION
[2]  
FORREST S, 1991, EMERGENT COMPUTATION
[3]  
GAKS P, 1978, PROBL PEREDACHI INF, V14, P92
[4]   COMPUTATION AT THE EDGE OF CHAOS - PHASE-TRANSITIONS AND EMERGENT COMPUTATION [J].
LANGTON, CG .
PHYSICA D, 1990, 42 (1-3) :12-37
[5]  
MITCHELL M, 1993, COMPLEX SYSTEMS, V7, P89
[6]  
Tommaso T., 1987, CELLULAR AUTOMATA MA
[7]  
WOLFRAM S, 1986, THEORY APPLICATIONS