LaTeX.org

I'm not having a problem with recursion, never indicated one. I have plenty of examples of my own, a macro that recursively calculates n! (probably everybody's first example of recursion), recursive implementation of the bisection method and Newton's Method to approximate solutions to equations, a ...

You stopped reading? That's very rude and judgmental. I'm hardly the first person to push the envelope of TeX's applicability beyond that of typesetting. Indeed, Dr. Knuth invites such imagination, see the opening paragraph to his Appendix on Dirty Tricks. Besides that, my macros are not intended ...

I found one of my utility macros, which is used often in the recursion, with two variables unnecessarily defined using \xdef. I changed these to \edef, as suggested by p. 301 of the \TeXbook, and the program ran for values of the parameter L up to 6 or 7. Then I increased L to 9 and got another, but ...

Johannes, Thanks for staying with me on this. I did not immediately translate your Ulrike reference into something I could use. I ran tex with the option --save-size = n where n = 60000, 70000, 80000, 90000 (50000 is the default).
I got the capacity error TeX capacity exceeded, sorry [save_size = n ...

The post I refer to above is the April 4, 2012 post listed below. It explains how to reset save_size in a TeX Live system. I would like to try something like this on my MikTeX system. Please let me know the name of the MikTeX file to edit the current value of save_size.

The post I refer to above is the April 4, 2012 post listed below.

Johannes, thanks, I appreciate your interest. I tried LuaTeX, no help, the same capacity error.

I took the words, "recompile TeX to regenerate all format files," from another post. Now I know what they mean, to run initexmf. Thanks. I have not yet learned how to reset the save_size variable in ...

I've written a system of TeX macros that work recursively to generate certain sets of sequences of integers with prescribed sums. The system works recursively on the length L of the sequence of integers. Starting with a given L, the recursion digs down to L = 1 and then works back up, L = 2,
and so ...