The Euclidean algorithm computes the greatest common divisor of two given integers. It is shown that the structure of the Euclidean algorithm may be used to automatically generate, very efficiently, a large family of rhythms used as timelines in traditional world music.
posted on on Tuesday, December 02, 2008 by Tiago D'Herbe (1416)