Emergent algorithm

An emergent algorithm is an algorithm that has the following characteristics: ^{[dubious – discuss]}

it achieves predictable global effects
it does not require global visibility
it does not assume any kind of centralized control
it is self-stabilizing

Emergence is said to arise from the cooperation of many simple processes, i.e. high-level behaviour resulting from low-level interaction of simpler building blocks.^{[example needed]}

Examples of emergent algorithms and models include cellular automata,^[1] artificial neural networks and swarm intelligence systems (ant colony optimization, bees algorithm, etc.).

References

^ Brunner, Klaus A. (2002). "What's emergent in Emergent Computing?" (PDF). Cybernetics and Systems 2002: Proceedings of the 16th European Meeting on Cybernetics and Systems Research. Vol. 1. Vienna. pp. 189–192. Retrieved 2009-02-18. {{cite conference}}: Cite has empty unknown parameter: |coauthors= (help); Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[1] Brunner, Klaus A. (2002). "What's emergent in Emergent Computing?" (PDF). Cybernetics and Systems 2002: Proceedings of the 16th European Meeting on Cybernetics and Systems Research. Vol. 1. Vienna. pp. 189–192. Retrieved 2009-02-18. {{cite conference}}: Cite has empty unknown parameter: |coauthors= (help); Unknown parameter |booktitle= ignored (|book-title= suggested) (help)

[1]

See also

References