What's wrong with making a recursive function in a recursive function with variables M, m, N, n? It's perfectly fine when I'm writing infinite series.

[–] CanadaPlus@lemmy.sdf.org 1 points 2 months ago (1 children)

If we're talking mathematicians, you just know it's going to be ω-nested recursive functions any moment now. Just be grateful it's not all n with polynomial subscripts or something.

[–] Leate_Wonceslace@lemmy.dbzer0.com 1 points 2 months ago (1 children)

Polynomial subscripts sound awesome, ngl. Never seen it before; I want to know what the applications are.

[–] CanadaPlus@lemmy.sdf.org 1 points 2 months ago* (last edited 2 months ago)

Uhh, I'm pretty sure I've seen that, but I'm not sure where now. Any time you need to access a member of a list or array that's determined by a polynomial - which by Horner's rule covers all combinations of multiplications and additions - it would be a possible notation.

Transfinite algorithms are definitely a topic of research.