I love lambda calculus! I considered formulating Solomonoff induction in lambda calculus instead, but I’m more familiar with Turing machines and that’s what the literature uses so far. (Also Zvonkin and Levin 1970 use partial recursive functions.) It wasn’t obvious to me how to alter lambda calculus to have a monotonic input and output, like with the three-tape Turing machine above.
I love lambda calculus! I considered formulating Solomonoff induction in lambda calculus instead, but I’m more familiar with Turing machines and that’s what the literature uses so far. (Also Zvonkin and Levin 1970 use partial recursive functions.) It wasn’t obvious to me how to alter lambda calculus to have a monotonic input and output, like with the three-tape Turing machine above.
You do that by having a term that takes a linked list of boolean values and returns a linked list of boolean values.