Dissipative Arithmetic

COMPLEX SYSTEMS(2022)

引用 0|浏览3
暂无评分
摘要
Large arithmetic expressions are dissipative: they lose information and are robust to perturbations. Lack of conservation gives resilience to fluctuations. The limited precision of floating point and the mixture of linear and nonlinear operations make such functions anti-fragile and give a largely stable locally flat plateau a rich fitness landscape. This slows long-term evolution of complex programs, suggesting a need for depthaware crossover and mutation operators in tree-based genetic programming. It also suggests that deeply nested computer program source code is error tolerant because disruptions tend to fail to propagate, and therefore the optimal placement of test oracles is as close to software defects as practical.
更多
查看译文
关键词
information loss,irreversible computing,entropy,evolvability,arithmetic,software mutational robustness,optimal test,oracle placement,evolution of complexity,data dependent,computational irreducibility,effective computational equivalence,experimental mathematics,algorithmic information dynamics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要