At 10:19 01/02/05 -0800, Hal Finney wrote:
Bruno writes:
> I am not sure that I understand what you do with that measure on programs.
> I prefer to look at infinite coin generations (that is infinitely
> reiterated self-duplications)
> and put measure on infinite sets of alternatives. Those infinit
On 1 Feb 2005 Hal Finney wrote:
Here is how I approach it, based on Schmidhuber. Suppose we pick a model
of computation based on a particular Universal Turing Machine (UTM).
Imagine this model being given all possible input tapes. There are an
uncountably infinite number of such tapes, but on any
2 matches
Mail list logo
