Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!philabs!seismo!hao!hplabs!sri-unix!Martin@YALE.ARPA
From: Martin@YALE.ARPA@sri-unix.UUCP
Newsgroups: net.sf-lovers
Subject: Bit strings for alternate universes
Message-ID: <4702@sri-arpa.UUCP>
Date: Tue, 30-Aug-83 15:05:51 EDT
Article-I.D.: sri-arpa.4702
Posted: Tue Aug 30 15:05:51 1983
Date-Received: Fri, 2-Sep-83 17:15:12 EDT
Lines: 11

From:     Charles Martin <Martin@YALE.ARPA>

I think Scott Turner's objection is invalid.  It doesn't matter that the
N+1 decision is different, since we know (at the time we evaluate the N+1
bit) the value of the N bit (am I presuming?).  Thus, we're looking through
an infinite binary tree.

The assumption that makes this idea unpalatable to me is the assumption that
the alternate universes are amenable to binary representations in the first
place.
-------