Re:Lisp in an “impossible” language, the most complex Malbol...
by AndrewDucker on Thursday August 05, 2021 @03:38AM
(#28070932)
Does the "bf" stand "brainfuck", that being another ridiculously hard language?
Re:Lisp in an “impossible” language, the most complex Malbol...
by palaiologos on Thursday August 05, 2021 @04:16AM
(#28071146)
yes!
Re:Lisp in an “impossible” language, the most complex Malbol...
by AndrewDucker on Thursday August 05, 2021 @04:29AM
(#28071215)
I am impressed - are you working your way through a list of Turing tarpits?
Re:Lisp in an “impossible” language, the most complex Malbol...
by palaiologos on Thursday August 05, 2021 @07:08AM
(#28072114)
... maybe :). A while ago I published a writeup on programming in the Seed language (https://esolangs.org/wiki/Seed) and made the best Mersenne Twister cracking program to date (which is described, alongside source code on my website: https://palaiologos.rocks/posts/mersenne-twister/). It gained somewhat widespread popularity in esoteric-ish circles, but after I posted the writeup and revealed the source code I wrote, everyone seemed to have stopped caring.
Which is mainly why I'll never reveal how my Malbolge tooling exactly works - uncertainity is stronger than reason. Maybe because of the mindset people have that "if an explanation is published, it must be simple" paired together with "it's incredibly long and boring, so i'm not going to read it".
And indeed, there existed a small bug in my generator code, which was discovered after 1.5 years, because that's how long it took for someone to try reading and understanding the entire blog post...
Re:Lisp in an “impossible” language, the most complex Malbol...
by AndrewDucker on Thursday August 05, 2021 @08:07AM
(#28072544)
Seed is a new one to me. That is even more ridiculous than Befunge itself! Very impressive work.
I used my existing project called asm2bf: https://github.com/kspalaiologos/asmbf (feel free to check it out), as a base for the high level assembler. And the original Lisp has been written in a tweaked version of it.
Once I was done, I optimised the high level version, and then took the asm2bf compiler output and did a few optimisations manually on it (everything that my peephole optimisation didn't catch).