00:07 <crc> the palindrome problem didn't have anything regarding efficiency; the problem description was "Program a generator or a filter to find all palindromic integers from 1 (yes, it is) to 99999."

00:17 <crc> http://forth.works/examples/palindromic-numbers.retro.html has two solutions in retro; one using a filter (using 101k memory locations), the other just displaying values as they are generated by a loop (using 74 memory locations)

01:14 <siraben> Is anyone still doing AoC in Forth?

02:12 <crc> siraben: I stopped after 6a, but might go back and do a few more

02:12 <siraben> crc: cool, day 18 and 19 would be interesting to do in Forth since they involve parsing

02:31 <crc> the first part of 18 looks like it'd be pretty straightforward

02:59 <yyyyyy> Does anyone have good resources on parallel processing in Forth? I have found some papers from the 90s but not much else. I have been modifying pForth to do shared memory parallelism, but I am curious what the other approaches have been tried.

08:45 <veltas> siraben: I'm still working on mine, day 3 big boy

08:46 <veltas> Trying to write arbitrary precision operations

08:47 <veltas> Because the result is massive, like 200 bits

08:47 <veltas> And I refuse to 'just do the product in python'

08:48 <veltas> I stopped for a week because my heart started acting up, hopefully unrelated to programming

08:50 <veltas> I don't know if I'll do all of them, but I might just as a demonstration of forth

08:57 <siraben> veltas: Ooh day 3 is a fun one, but the sol fits in my computer's Int (64 bits).

08:57 <siraben> Or 32, I forget

09:18 <veltas> siraben: The big boy is the issue

09:18 <siraben> big boy?

09:18 <veltas> Look up big boy advent of code

09:18 <veltas> I don't have link at hand

09:19 <siraben> er, not sure what I'm supposed to be looking for