This is an old revision of this page, as edited by Bryan Derksen (talk | contribs) at 06:38, 27 November 2003 (arrows). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 06:38, 27 November 2003 by Bryan Derksen (talk | contribs) (arrows)(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)Bio-inspired computing is an academic field of study that loosely knits together subfields related to the topics of connectionism, social behaviour and emergence. It is often closely related to the field of artificial intelligence, as many of its pursuits can be linked to machine learning. It relies heavily on the fields of biology, computer science and mathematics. Briefly put, it is the use of computers to model nature, and simultaneously the study of nature to improve the usage of computers.
Some areas of study encompassed under the canon of bio-inspired computing, and their biological inspirations:
- genetic algorithms ↔ evolution
- cellular automata ↔ life
- emergent systems ↔ ants, termites, bees, etc
- neural networks ↔ the brain
- artificial life ↔ life
- lindenmayer systems ↔ plant structures
One way in which bio-inspired computing differs from AI is in how it takes a more evolutionary approach to learning, as opposed the what could be described as 'creationist' methods used in traditional AI. In traditional AI, intelligence is often programmed from above: the programmer is the creator, and makes something and imbues it with its intelligence. Bio-inspired computing, on the other hand, takes a more bottom-up approach; bio-inspired techniques often involve the method of specifying a set of simple rules, a set of simple organisms which adhere to those rules, and a method of iteratively applying those rules. After several generations of rule application it is usually the case that some forms of complex behaviour arise. Complexity gets built upon complexity until the end result is something markedly complex, and quite often completely counterintuitive from what the original rules would be expected to produce (see genetic programming).
Natural evolution is a good analogy to this method–the rules of evolution (selection, recombination/reproduction, and mutation) are in principle simple rules, yet over thousands of years have produced remarkably complex organisms. A similar technique is used in genetic algorithms.
This article is a stub. You can help Misplaced Pages by fixing it.