How many bits can a flock of birds compute?

DOI10.4086/TOC.2014.V010A016MaRDI QIDQ5497119zbMATH OpenOpenAlexFDO

Authors Bernard Chazelle

Publication date 3 February 2015

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2014.v010a016

zbMATH Keywords

dynamical systemsnatural algorithmsbird flockingbusy-beaver function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• The Convergence of Bird Flocking
• Natural algorithms
• The geometry of flocking
• On flocks influenced by closest neighbors
• Large flocks of small birds: on the minimal size of population protocols

Cites work

• Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
• Stability of multiagent systems with time-dependent communication links

Cited in

(2)

• The geometry of flocking
• Natural algorithms

Describes a project that uses

Uses Software

• Boids

This page was built for publication: How many bits can a flock of birds compute?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5497119)