Hal Finney wrote:
That would be true IF you include descriptions that are infinitely long.
Then the set of all descriptions would be of cardinality c. If your
definition of a description implies that each one must be finite, then the
set of all of them would have cardinality aleph-zero.
Gentlemen (and Ladies, if some be present here),
I offer you a small bit of wisdom and irony,
presented in a bit of humor.
Statement of vernacular AND mathematical truth:
The universe is an ODD PLACE. (!)
[i.e., it is imbalanced and -not- fundamentally symmetric]
PROOF:
-infinity ---
Russell Standish writes to Bruno Marchal:
As you have well pointed out, the set of all descriptions can be
computed in c time (c = cardinality of the reals) on an ordinary
Universal Turing Machine via the UD. It is, however, a nonclassical
model of computation.
That doesn't sound right to me.
,
Stephen
- Original Message -
From: Hal Finney [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Friday, November 29, 2002 9:04 PM
Subject: Re: Everything need a little more than 0 information
Russell Standish writes to Bruno Marchal:
As you have well pointed out, the set of all
4 matches
Mail list logo
