[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: GUT and P=NP

To: [email protected]
Subject: Re: GUT and P=NP
From: [email protected] (Mike McNally)
Date: Tue, 26 Jul 94 10:42:31 CDT
Cc: [email protected], [email protected]
In-Reply-To: <[email protected]>
References: <[email protected]>
Sender: [email protected]

[email protected] writes:
 > Let f be a function from the integers to [0,1].  Note that the
 > Turing tape has precisely one space for each integer, so this
 > function cooresponds to your idea.

Can you (without being an asshole) explain why exactly each tape
position may contain only a simple integer?  It's perfectly reasonable
to define the tape alphabet to be an arbitrary set; can the set not
be uncountably infinite?  If not, why not?

| GOOD TIME FOR MOVIE - GOING ||| Mike McNally <[email protected]>       |
| TAKE TWA TO CAIRO.          ||| Tivoli Systems, Austin, TX:        |
|     (actual fortune cookie) ||| "Like A Little Bit of Semi-Heaven" |

Follow-Ups:
- Re: GUT and P=NP
  - From: [email protected] (Timothy C. May)

References:
- Re: GUT and P=NP
  - From: [email protected]

Prev by Date: Local Cypherpunks (?) group
Next by Date: Re: CYPHERPUNKS TO THE RESCUE
Prev by thread: Re: GUT and P=NP
Next by thread: Re: GUT and P=NP
Index(es):
- Date
- Thread