Ockham's Razor

[PairTheBoard]

The thing is, for any randomly generated program that computes pi correctly for some digits, that program can have add-on lines of code that don't essentially change it. It can have infinitely many add-ons. I don't see any way you could reasonably Pronounce a probalility measure on that space of unbounded finite randomly generated codes. I don't think the proper measure on such a space would even be a probability measure.

If this arguement really has technical merit, somebody has written a peer reviewed paper on it somewhere that you should be able to reference. I doubt you can do that.

PairTheBoard