Re: Solution to 7 over sqr(71) time against integer polyrhythms

[Carl Sorensen]

On 11/17/16 7:21 PM, "mclaren" <address@hidden> wrote:
>
>The deceptive Lilypond code shown above that prints those fake tuplets is
>truly contemptible because it doesn't address the real issue.  The real
>issue is that Lilypond doesn't allow nested tuplets beyond very small
>values
>of tuplets (like 4:3, 7:5, etc.) for reasons having to do with internal
>integer limits on calculations in Lilypond.  Now, that truly is
>ridiculous.
>We're dealing with modern computers with 4 or 8 or 16 gigs of RAM or more,
>multi-core CPUs with full floating point units in hardware, and hard
>drives
>with terabytes of storage. And you're telling me all this computing power
>is
>incapable of calculating an approximation to .99^10 or .99^20 or .99^50?
>You're telling me that that approximation of .99^50 can't be turned into
>an
>integer with some negligible error in the approximation? Please.

There is a GNU library for arbitrary precision rationals.  It may be
possible to replace the LilyPond Rational type with an arbitrary precision
rational type.  Then the ability to go to big nested tuplets would be
limited by the amount memory (perhaps the amount on the heap or the stack).

You can find more information about GMP here:  https://gmplib.org/

HTH,

Carl