News for hackers. Stuff that matters.
Re:1D Conway's Life glider found, 3.7B cells long by jachee on Wednesday December 03, 2025 @07:00PM (#46142026)
How about Assembly?
Re:1D Conway's Life glider found, 3.7B cells long by tombert on Wednesday December 03, 2025 @07:04PM (#46142055)
Assembly is higher level logic than brainfuck, especially on modern chips. You have built in instructions for arithmetic and conditionals/branches and you can allocate memory and point to it.

You don’t really get any of that with brainfuck. You have a theoretical tape and counters and that’s basically it.

Re:1D Conway's Life glider found, 3.7B cells long by eru on Wednesday December 03, 2025 @10:50PM (#46143620)
SKI calculus is pretty neat, too. You get no tape, no counters. (But it's not quite as bad to program in as brainfuck, because you can built more ergonomic contraptions to help you along.)
Re:1D Conway's Life glider found, 3.7B cells long by somat on Thursday December 04, 2025 @05:14AM (#46145887)
Unlambda solves that problem.

"What if we had the lambda calculus without the lambda forms?" asked no one.

http://www.madore.org/~david/programs/unlambda/

Re:1D Conway's Life glider found, 3.7B cells long by arethuza on Thursday December 04, 2025 @11:34AM (#46149503)
SKI can, of course, be de-optimised a bit further by replacing I with SKK. You are right though that it is relatively simply to go from something that looks like a normal program languages to a pile of S and K combinators. Not the most efficient way to compute though!