And it came to pass that my mind turned once again to the question of whether there are any universal computational classes smaller than the class of recursively enumerable functions.
And lo, did I try to write a self-interpreter that was obviously not Turing-complete; and lo, did I fail. Pretty sure I failed, yeah.
But the result, behold! It was less than half the size of Pixley's
meta-circular interpreter. So did I keep it, and did I christen it
Yolk, and verily did I wax philosophical in its README about