当前位置:
X-MOL 学术
›
arXiv.cs.FL
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2021-08-11 , DOI: arxiv-2108.05402 Damian Arellanes
arXiv - CS - Formal Languages and Automata Theory Pub Date : 2021-08-11 , DOI: arxiv-2108.05402 Damian Arellanes
We are entering a new era in which software systems are becoming more and
more complex and larger. So, the composition of such systems is becoming
infeasible by manual means. To address this challenge, self-organising software
models represent a promising direction since they allow the (bottom-up)
emergence of complex computational structures from simple rules. In this paper,
we propose an abstract machine, called the composition machine, which allows
the definition and the execution of such models. Unlike typical abstract
machines, our proposal does not compute individual programs but enables the
emergence of multiple programs at once. We particularly present the machine's
semantics and provide examples to demonstrate its operation with well-known
rules from the realm of Boolean logic and elementary cellular automata.
中文翻译:
组合机:为序列程序空间的出现编写自组织软件模型
我们正在进入一个软件系统变得越来越复杂和庞大的新时代。因此,通过手动方式组合此类系统变得不可行。为了应对这一挑战,自组织软件模型代表了一个有希望的方向,因为它们允许从简单规则(自下而上)出现复杂的计算结构。在本文中,我们提出了一种抽象机器,称为组合机器,它允许定义和执行此类模型。与典型的抽象机器不同,我们的提议不计算单个程序,而是允许同时出现多个程序。我们特别介绍了机器的语义,并提供了示例来演示其使用布尔逻辑和基本元胞自动机领域的众所周知的规则的操作。
更新日期:2021-08-13
中文翻译:
组合机:为序列程序空间的出现编写自组织软件模型
我们正在进入一个软件系统变得越来越复杂和庞大的新时代。因此,通过手动方式组合此类系统变得不可行。为了应对这一挑战,自组织软件模型代表了一个有希望的方向,因为它们允许从简单规则(自下而上)出现复杂的计算结构。在本文中,我们提出了一种抽象机器,称为组合机器,它允许定义和执行此类模型。与典型的抽象机器不同,我们的提议不计算单个程序,而是允许同时出现多个程序。我们特别介绍了机器的语义,并提供了示例来演示其使用布尔逻辑和基本元胞自动机领域的众所周知的规则的操作。