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|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>, (but not [[Indian]])<ref>[http://cgm.cs.mcgill.ca/~godfried/publications/banff-extended.pdf ~~The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint,~~ Extended version of the paper that appeared in the ~~‘’Proceedings~~ of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31-August 3, 2005, pp. 47-56.]</ref>

The '''Euclidean Rythm''' was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The [[Euclidean algorithm|Euclidean Algorithm]] Generates Traditional Musical Rhythms"<ref name="gtpdf">[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms] by G. T. Toussaint, ''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>.<ref name="extv">The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint, [http://cgm.cs.mcgill.ca/~godfried/publications/banff-extended.pdf Extended version] of the paper that appeared in the ''Proceedings of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31-August 3, 2005, pp. 47-56.</ref>

===Open Source Hardware Projects===

Revision as of 17:41, 29 June 2012 (view source) Rob Kam (talk \| contribs) mNo edit summary ← Older edit		Revision as of 17:50, 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\|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>, (but not [[Indian]])<ref>[http://cgm.cs.mcgill.ca/~godfried/publications/banff-extended.pdf ~~The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint,~~ Extended version of the paper that appeared in the ~~‘’Proceedings~~ of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31-August 3, 2005, pp. 47-56.]</ref>		The '''Euclidean Rythm''' was discovered by [[Godfried Toussaint]] in 2004 and is described in a 2005 paper "The [[Euclidean algorithm\|Euclidean Algorithm]] Generates Traditional Musical Rhythms"<ref name="gtpdf">[http://cgm.cs.mcgill.ca/~godfried/publications/banff.pdf The Euclidean algorithm generates traditional musical rhythms] by G. T. Toussaint, ''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>.<!--, (but not [[Indian]])--><ref name="extv">The Euclidean Algorithm Generates Traditional Musical Rhythms, by Godfried Toussaint, [http://cgm.cs.mcgill.ca/~godfried/publications/banff-extended.pdf Extended version] of the paper that appeared in the ''Proceedings of BRIDGES: Mathematical Connections in Art, Music and Science’’, Banff, Alberta, Canada, July 31-August 3, 2005, pp. 47-56.</ref>

	===Open Source Hardware Projects===		===Open Source Hardware Projects===

Euclidean rhythm: Difference between revisions

Navigation menu

Search