经典排序算法作为形态发生模型:自排序数组在基础智能最小模型中揭示出意想不到的能力
Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence
AI总结:
本文将经典排序算法作为形态发生模型,通过赋予数组元素自下而上的自主性和允许硬件故障,发现自排序数组在存在错误时比传统实现更可靠鲁棒,并展现出绕障和聚类等涌现的问题解决能力,为理解基础智能的最低要求提供了新视角。
摘要:
新兴的多样智能(Diverse Intelligence)领域致力于识别、形式化并理解跨多种实现方式中行为能力的共性。尤其令人感兴趣的是那些简单系统,它们在乍看之下似乎不够复杂、不足以实现记忆、决策或问题解决能力,却提供了出人意料的实例。我们力求开发工具,以帮助理解这些能力的最低要求,并学会识别和预测非常规基质中的基础智能形式。在此,我们对经典排序算法的行为进行了新颖的分析,这些短小的代码片段已被研究数十年。为了将这些排序算法作为生物形态发生及其能力的一个模型来研究,我们打破了两项此前普遍存在的假设:自上而下的控制(相反,我们展示了数字数组中的每个元素如何施加最小限度的自主性,并自下而上地执行排序策略),以及完全可靠的硬件(相反,我们允许部分元素被“损坏”而无法执行算法)。我们定量地将排序活动刻画为问题空间中的遍历,结果表明,在存在错误的情况下,由自主元素组成的数组比传统实现方式更可靠、更鲁棒地完成自排序。此外,我们发现了为绕过缺陷而暂时降低进展的能力,以及嵌合数组中元素之间意想不到的聚类行为,这些数组中的元素遵循两种不同算法之一。在简单且为人熟知的算法中发现涌现的问题解决能力,为多样智能领域贡献了新的视角,表明基础智能形式可以在简单系统中涌现,而无需在其底层机制中被显式编码。
英文摘要:
The emerging field of Diverse Intelligence seeks to identify, formalize, and understand commonalities in behavioral competencies across a wide range of implementations. Especially interesting are simple systems that provide unexpected examples of memory, decision-making, or problem-solving in substrates that at first glance do not appear to be complex enough to implement such capabilities. We seek to develop tools to help understand the minimal requirements for such capabilities, and to learn to recognize and predict basal forms of intelligence in unconventional substrates. Here, we apply novel analyses to the behavior of classical sorting algorithms, short pieces of code which have been studied for many decades. To study these sorting algorithms as a model of biological morphogenesis and its competencies, we break two formerly-ubiquitous assumptions: top-down control (instead, showing how each element within a array of numbers can exert minimal agency and implement sorting policies from the bottom up), and fully reliable hardware (instead, allowing some of the elements to be "damaged" and fail to execute the algorithm). We quantitatively characterize sorting activity as the traversal of a problem space, showing that arrays of autonomous elements sort themselves more reliably and robustly than traditional implementations in the presence of errors. Moreover, we find the ability to temporarily reduce progress in order to navigate around a defect, and unexpected clustering behavior among the elements in chimeric arrays whose elements follow one of two different algorithms. The discovery of emergent problem-solving capacities in simple, familiar algorithms contributes a new perspective to the field of Diverse Intelligence, showing how basal forms of intelligence can emerge in simple systems without being explicitly encoded in their underlying mechanics.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。