this post was submitted on 12 Sep 2024
294 points (96.2% liked)

Programmer Humor

19503 readers
1263 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
 

var Turtle1 var Turtle2 var Is_Turtle

you are viewing a single comment's thread
view the rest of the comments
[–] [email protected] 5 points 1 month ago (3 children)

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.

[–] [email protected] 1 points 1 month ago (2 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.

[–] [email protected] 1 points 1 month ago (1 children)

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

[–] [email protected] 1 points 1 month ago* (last edited 1 month 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.