Emergent algorithm

From Wikipedia, the free encyclopedia
Jump to: navigation, search

An emergent algorithm is an algorithm that has the following characteristics:[dubious ]

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.[examples needed]

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

See also[edit]


  1. ^ Brunner, Klaus A. (2002). "What's emergent in Emergent Computing?". Cybernetics and Systems 2002: Proceedings of the 16th European Meeting on Cybernetics and Systems Research 1. Vienna. pp. 189–192. Retrieved 2009-02-18.