"Jesse Mazer" <[EMAIL PROTECTED]>:
> [re: rock is a good implementation of any computation]
> It depends what you mean by "good implementation." The context of my
> comment above was, *if* you believe there is a single true set of
> psychophysical laws, are the laws likely to be defined in term
Dear John:
Below I have slightly rewritten my argument along the lines I had
originally intended - the first effort was too rushed. The rewrite may
answer your question.
At 2/12/01, you wrote:
>Hal, you wrote (among lots of other things):
> > 2) But the other universe also has to stop given t
[EMAIL PROTECTED]:
> This constructive notion of formal describability is less restrictive
> than the traditional notion of computability, mainly because we do not
> insist on the existence of a halting program that computes an upper
> bound of the convergence time of p's n-th output bit. Formal
Hal, you wrote (among lots of other things):
> 2) But the other universe also has to stop given the fixed FAS complexity
> i.e. another new running contradiction.
Can you discern - after the split - which is "the other"?
(excuse me for this question for a situation which I do not condone at all).
> Resent-Date: Fri, 9 Feb 2001 06:15:47 -0800
> Subject: Re: on formally describable universes and measures
> From: Marchal <[EMAIL PROTECTED]>
>
> >No, I do not. I suggest you first define a formal framework for
> >measuring delays etc. Then we can continue.
>
> You should have told me this at
"James Higgo" wrote:
>Jesse,
>
>The point you picked up 'self-referential thought' is not relevant to the
>discussion we were having. However, it is the most interesting thing in my
>post.
I think it's actually pretty relevant. What we're talking about is what
Nick Bostrom calls "the problem o
> From: [EMAIL PROTECTED]
> To: [EMAIL PROTECTED]
> Subject: Re: Algorithmic TOEs vs Nonalgorithmic TOEs
> Date: Fri, 9 Feb 2001 19:26:23 EST
>
> [EMAIL PROTECTED]:
> > Nobody will ever be able to fully describe anything that is not
> > computable in the limit by a general Turing Machine.
>
> I
7 matches
Mail list logo
