Analysis of the collage in fashion design

Wang, M; Sun, Shaoping; Chai, X

doi:10.1201/b16698-106

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, we introduced the notion of damaged or malfunctioning cells that cannot move even when the algorithm says they should. While unreliable computing is an existing field (Brown et al, 2015;Wang, 2014), the standard study of sorting algorithms assumes that the steps are followed correctly. By contrast, biology excels at managing a highly noisy, unreliable medium at every scale (Noble, 2021;Noble & Noble, 2018), utilizing this condition as an important aspect of evolving problem-solving machines (not unique solutions) (Levin, 2023c).…”

Section: Discussionmentioning

confidence: 99%

Classical Sorting Algorithms as a Model of Morphogenesis: self-sorting arrays reveal unexpected competencies in a minimal model of basal intelligence

Zhang,

Goldstein,

Levin

2023

Preprint

View full text Add to dashboard Cite

The Diverse Intelligence research seeks to 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 determine 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 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, each element within an array of numbers can exert minimal agency and implement sorting policies from the bottom up), and fully reliable hardware (instead, allowing elements to be “damaged” and fail to execute the algorithm). We quantitatively characterize sorting activity as 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 elements in chimeric arrays consisting of two different algorithms. The discovery of emergent problem-solving capacities in simple, familiar algorithms contributes a new perspective showing how basal forms of intelligence can emerge in simple systems without being explicitly encoded in their underlying mechanics.

show abstract