1994-07-26 - Re: GUT and P=NP

Header Data

From: m5@vail.tivoli.com (Mike McNally)
To: nzook@fireant.ma.utexas.edu
Message Hash: c3a93758e7f0650816f554c7f9ee0133974b7f822e80d08250c5bfc2d08ed7d9
Message ID: <9407261542.AA03740@vail.tivoli.com>
Reply To: <9407261520.AA11661@vendela.ma.utexas.edu>
UTC Datetime: 1994-07-26 15:43:22 UTC
Raw Date: Tue, 26 Jul 94 08:43:22 PDT

Raw message

From: m5@vail.tivoli.com (Mike McNally)
Date: Tue, 26 Jul 94 08:43:22 PDT
To: nzook@fireant.ma.utexas.edu
Subject: Re: GUT and P=NP
In-Reply-To: <9407261520.AA11661@vendela.ma.utexas.edu>
Message-ID: <9407261542.AA03740@vail.tivoli.com>
MIME-Version: 1.0
Content-Type: text/plain

nzook@fireant.ma.utexas.edu 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 <m5@tivoli.com>       |
| TAKE TWA TO CAIRO.          ||| Tivoli Systems, Austin, TX:        |
|     (actual fortune cookie) ||| "Like A Little Bit of Semi-Heaven" |