= 27d567bc2d48d9f40e9ccc20ea370b15)
Alex_Altair comments on What are you working on? February 2012 - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (90)
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.