Euclidean rhythm: Difference between revisions

Line 1:

The '''Euclidean Rythm''' was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The Euclidean Algorithm Generates Traditional Musical Rhythms"<ref name="gtpdf">G. T. Toussaint, ''"[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms]"'', ''Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science'', Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.</ref> The [[greatest common divisor]] of two numbers is used [[Rhythm|rhythmically]] giving the number of [[beats]] and silences, and generating almost all of the most important ~~musical rhythms used in~~ [[World Music]].<ref name="gtweb">[http://cgm.cs.mcgill.ca/~godfried/rhythm-and-mathematics.html Comparative Musicology - Musical Rhythm and Mathematics]</ref>

The '''Euclidean Rythm''' was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The Euclidean Algorithm Generates Traditional Musical Rhythms"<ref name="gtpdf">G. T. Toussaint, ''"[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms]"'', ''Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science'', Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.</ref> The [[greatest common divisor]] of two numbers is used [[Rhythm|rhythmically]] giving the number of [[beats]] and silences, and generating almost all of the most important [[World Music]] rhythms.<ref name="gtweb">[http://cgm.cs.mcgill.ca/~godfried/rhythm-and-mathematics.html Comparative Musicology - Musical Rhythm and Mathematics]</ref>

===Open Hardware projects===

Revision as of 15:54, 29 June 2012 (view source) Rob Kam (talk \| contribs) No edit summary ← Older edit		Revision as of 16:26, 29 June 2012 (view source) Rob Kam (talk \| contribs) No edit summary Newer edit →
Line 1:		Line 1:
	The '''Euclidean Rythm''' was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The Euclidean Algorithm Generates Traditional Musical Rhythms"<ref name="gtpdf">G. T. Toussaint, ''"[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms]"'', ''Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science'', Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.</ref> The [[greatest common divisor]] of two numbers is used [[Rhythm\|rhythmically]] giving the number of [[beats]] and silences, and generating almost all of the most important ~~musical rhythms used in~~ [[World Music]].<ref name="gtweb">[http://cgm.cs.mcgill.ca/~godfried/rhythm-and-mathematics.html Comparative Musicology - Musical Rhythm and Mathematics]</ref>		The '''Euclidean Rythm''' was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The Euclidean Algorithm Generates Traditional Musical Rhythms"<ref name="gtpdf">G. T. Toussaint, ''"[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms]"'', ''Proceedings of BRIDGES: Mathematical Connections in Art, Music, and Science'', Banff, Alberta, Canada, July 31 to August 3, 2005, pp. 47–56.</ref> The [[greatest common divisor]] of two numbers is used [[Rhythm\|rhythmically]] giving the number of [[beats]] and silences, and generating almost all of the most important [[World Music]] rhythms.<ref name="gtweb">[http://cgm.cs.mcgill.ca/~godfried/rhythm-and-mathematics.html Comparative Musicology - Musical Rhythm and Mathematics]</ref>

	===Open Hardware projects===		===Open Hardware projects===

Euclidean rhythm: Difference between revisions

Navigation menu

Search