A Very Short Self-Interpreter — mentioned by mdonahoe

Thu, 24 Feb 2022 00:50:41 GMT

You are correct, this is what I meant. I've found "self-interpreter" implementations that aim to be short https://arxiv.org/html/cs/0311032 https://codegolf.stackexchange.com/questions/585/self-interp... But I haven't found anyone yet that optimized for actual number of recursive implementations on a real machine.

Paper and discussion history. A mention is not an endorsement.

A Very Short Self-Interpreter — mentioned by tromp

Thu, 28 May 2020 09:48:33 GMT

It takes 829 bits of binary lambda calculus to interpret BrainFuck, which is very simple programming language modeled after Turing Machines. A self-interpreter in BrainFuck takes well over a thousand bits though [2]. Lambda calculus is not only very simple, but also very expressive. While combinatory logic, with only S and K, is even simpler than lambda calculus, and also has a trivial binary encoding (00 for S, 01 for K, and 10 for application), the shortest known self-interpreter is 263 bits, appreciably larger than for lambda calculus. My IOCCC entry [3] has more examples of the…

Paper and discussion history. A mention is not an endorsement.

A Very Short Self-Interpreter · HackerPapers discussions

A Very Short Self-Interpreter — mentioned by mdonahoe

A Very Short Self-Interpreter — mentioned by tromp