2025-04-01 00:34:37 mforth: " une fée dans un paysage enchanté " IMAGE 2025-04-01 00:34:53 https://tinyurl.com/22aadfol 2025-04-01 00:35:55 a touch of modernism in an old school program :) 2025-04-01 00:53:38 mforth: " un groupe de zombies dans un paysage post apocalyptique " IMAGE 2025-04-01 00:53:52 https://tinyurl.com/28wepnyo 2025-04-01 04:40:07 mforth: " un groupe de zombies dans un paysage post apocalyptique " IMAGE 2025-04-01 04:40:19 https://tinyurl.com/29usqjhu 2025-04-01 05:33:32 what's the fastest forth? 2025-04-01 05:34:05 if I wanna number crunch, you'd think something written in assembly would beat a JIT 2025-04-01 05:34:28 yes 2025-04-01 05:38:09 forth: " une fée dans un paysage enchanté " IMAGE 2025-04-01 05:38:56 mforth: " une fée dans un paysage enchanté " IMAGE 2025-04-01 05:39:11 https://tinyurl.com/2xttv9ef 2025-04-01 05:41:32 cleobuline: like? 2025-04-01 05:41:47 like what ? 2025-04-01 05:42:01 you said yes to my question or no? 2025-04-01 05:44:23 do you plan to write an assebly forth ? 2025-04-01 05:50:52 no 2025-04-01 05:51:12 I was whining about forth being slower than C and even JIT languages and someone mentioned vfx forth being the fastest forth, but since I can't even download it, I was wondering what everyone thinks 2025-04-01 08:27:16 nmz: If you want to number crunch, then the fastest language is usually literally anything that lets you write SIMD instructions or intrinsics, and spawn multiple threads 2025-04-01 08:27:43 If it's really not parallelisable then usually it's still whatever lets you write inline assembly 2025-04-01 08:27:52 So assembler, C, Rust, Forth, etc 2025-04-01 08:28:35 But if that's not feasible for most of the work, then you're probably better off with C, which has a more mathsy syntax anyway and a lot more compiler effort behind it 2025-04-01 08:29:05 Forth is that tradeoff where having a smaller implementation is desirable, but obviously that means you won't get the fastest code in all situations 2025-04-01 13:52:36 mforth: " un fée dans un paysage enchanté " IMAGE 2025-04-01 13:52:49 https://tinyurl.com/2b6xf95h 2025-04-01 13:53:30 it went a bit overboard with the fairy 2025-04-01 13:54:19 the magic forth :) 2025-04-01 13:54:25 I count onze fées but I might be missing some 2025-04-01 13:55:18 i like fairys 2025-04-01 13:57:06 xentrac only 3 fairys 2025-04-01 13:57:44 mforth: " un monstre horrible avec des grandes dents des gros yeux et plein de poils " IMAGE 2025-04-01 13:57:53 https://tinyurl.com/22y5e93t 2025-04-01 13:58:17 :) 2025-04-01 13:58:53 don't take lsd with this bot , use at your own risks ! 2025-04-01 14:21:41 I think I should use this image as a selfie on dating sites 2025-04-01 15:27:26 haha 2025-04-01 18:20:31 mforth: WORDS 2025-04-01 18:20:31 USERNAME .S . + - * / MOD DUP DROP SWAP OVER ROT >R R> R@ = < > AND OR NOT XOR & | ^ ~ << >> CR EMIT VARIABLE @ ! +! DO LOOP I WORDS LOAD CREATE ALLOT ." CLOCK BEGIN WHILE REPEAT AGAIN SQRT UNLOOP +LOOP PICK CLEAR-STACK PRINT NUM-TO-BIN PRIME? FORGET STRING " 2DROP IMAGE TEMP-IMAGE 2025-04-01 18:20:53 new : IMAGE and TEMP-IMAGE 2025-04-01 22:45:59 I was thinking that with a stack of arbitrary precision numbers, you don't need a string stack - you just need to interpret numbers as strings 2025-04-01 23:05:20 Yeah you don't even need a stack, you can just encode everything in one number 2025-04-01 23:05:47 But not much point 2025-04-01 23:35:59 How would you implement a concatenative language in Forth, just conceptually 2025-04-01 23:59:26 veqq: is forth not already concatenative?