3 ms·
One way is Solomonoff's universal prior. It's uncomputable, but supports the parent's argument since it's explicitly based on combining the results of every pos
by chriswarbo 6y ago
One way is Solomonoff's universal prior. It's uncomputable, but supports the parent's argument since it's explicitly based on combining the results of every possible program; and short programs end up dominating.