Wei Dai writes:
> Living in this universe is like living in a universe with a
> halting-problem oracle, right? If you want to know whether program x
> halts, you just measure the n-th pseudorandom event, where n is such that
> the n-th theorem is "x halts." Yes?
What about the instantiations of
On Fri, Nov 02, 2001 at 04:29:26PM -0800, [EMAIL PROTECTED] wrote:
> What about the instantiations of people who measure the event the other
> way before the universe gets restarted and re-run from that point? They
> would see the wrong answer to the halting question, but they are just
> as consc
At the bottom of http://parallel.hpc.unsw.edu.au/rks/docs/occam/node2.html
you wrote:
> There may well be some way of resolving this problem
> that leads to an absolute measure over all bitstrings.
> However, it turns out that an absolute measure is not
> required to explain features we observ
In a relatively trivial sense, observers must process
information. Quite what this means is a little unclear - for example
does it mean that all observers need to be capable of universal
computation?
It does seem to me that observers do implement some kind of totally
recursive function i.e. will
On Wed, Oct 31, 2001 at 10:49:41AM +0100, Juergen Schmidhuber wrote:
> Which are the logically possible universes? Tegmark mentioned a
> somewhat
> vaguely defined set of ``self-consistent mathematical structures,''
> implying provability of some sort. The postings of Marchal also focus
> on what
5 matches
Mail list logo
