Warning: Some posts on this platform may contain adult material intended for mature audiences only. Viewer discretion is advised. By clicking ‘Continue’, you confirm that you are 18 years or older and consent to viewing explicit content.
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.
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.
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.
Polynomial subscripts sound awesome, ngl. Never seen it before; I want to know what the applications are.
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.