More 2^a*3^b for low a stuff

[sniffnoy]

After much tedious computation, much of which accomplished little and the latest of which finally extended the result from a≤14 to a≤16, I think I finally see how to automate these computations. It's going to be a pain to program, though. I think I'm going to want to remember how to use programming languages other than C...

-Harry

Comments

[grenadier32.livejournal.com]

Ruby? Python? Perl? Mathematica? GNU Octave? :-P

[sniffnoy.livejournal.com]

I was actually thinking Haskell, but perhaps ML if that proves easier for me to remember... I don't remember any of these too well, but I remember that Haskell does union types well, and I don't remember which of the others do. (I am going to be making some strange trees here... because each tree will in fact be a structure representing an infinite number of trees...)

[sniffnoy.livejournal.com]

...what is GNU Octave?

[sniffnoy.livejournal.com]

Heh, I did not intend to literally have an infinite tree, though now that I think about it, in a way lazy evaulation is very good for what I mean to do. The idea was that I would have a "clump of 3s" structure that represented an indefinite number of 3s, and counted how many 3s had been pulled out of it... which sounds a lot like how Haskell can do indefinite lists and such via lazy evaluation, though not so sure about the counting, haven't thought about this in a while, after all.