What are you working on? February 2012

David_Gerard

This is the bimonthly 'What are you working On?' thread. Previous threads are here. So here's the question:

What are you working on?

Here are some guidelines:

Focus on projects that you have recently made progress on, not projects that you're thinking about doing but haven't started.
Why this project and not others? Mention reasons why you're doing the project and/or why others should contribute to your project (if applicable).
Talk about your goals for the project.
Any kind of project is fair game: personal improvement, research project, art project, whatever.
Link to your work if it's linkable.

This is the bimonthly 'What are you working On?' thread. Previous threads are here. So here's the question:

What are you working on?

Here are some guidelines:

Focus on projects that you have recently made progress on, not projects that you're thinking about doing but haven't started.
Why this project and not others? Mention reasons why you're doing the project and/or why others should contribute to your project (if applicable).
Talk about your goals for the project.
Any kind of project is fair game: personal improvement, research project, art project, whatever.
Link to your work if it's linkable.

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.