I have a math class where I get to work on anything I want. I’m currently researching ways to approximate Solomonoff Induction. I’ll need to use some subset of the recursively enumerable function so that it’s computable. Recently I found total functional programming as a way to accomplish this.
The Primitive Recursive Functions appear quite attractive as a subset of all computable functions. They always terminate, so one can use an enumeration to get a computable upper bound on Kolmogorov complexity. They look like they are rich enough that the upper bound could be low enough to be interesting.
I have a math class where I get to work on anything I want. I’m currently researching ways to approximate Solomonoff Induction. I’ll need to use some subset of the recursively enumerable function so that it’s computable. Recently I found total functional programming as a way to accomplish this.
The Primitive Recursive Functions appear quite attractive as a subset of all computable functions. They always terminate, so one can use an enumeration to get a computable upper bound on Kolmogorov complexity. They look like they are rich enough that the upper bound could be low enough to be interesting.