Re: poly: Infinite calculations in an open universe?

From: Anders Sandberg <asa@nada.kth.se>
Date: Tue Dec 09 1997 - 08:33:39 PST

Another factor which may help is reversible computing; the bounds
calculated by Tipler are actually lower bounds since we can do
reversible calculations beside the dissipating calculations (needed
for error correction, secure storage etc). In the Dyson scenario
things look even better, since thermal noise gets weaker and weaker
all the time, enabling more and more reversible calculations.

Hal Finney <hal@rain.org> writes:

> I wonder whether this multiplicative factor could counter Tipler's
> pessimistic conclusions about the possibilities for an open universe.
> Obviously multiplying computation efficiency by a constant factor would
> not help. I think it would be necessary over time to include larger and
> larger numbers of universes within the scope of the quantum computer.
> Would this require more and more matter to be available? That won't
> work well in a Dyson universe where matter is decreasing in density.
> Maybe you could do increasingly subtle (and time consuming?) measurements
> on a limited amount of matter in order to get the same effect.

I think the later is possible. The problem is the Bekenstein Bound,
which limits the amount of information (including quantum information?
I think so) in a given volume with mass. But if you enlarge the
volume, the information can grow with no increase in mass (you simply
enlarge the spatial dimensions of phase space). This suggests that you
can have at least t^2 growth of available states.

> Going from n to two-to-the-n is a very powerful step in counting theory.
> It raises you from one level of infinity to another. Could it conceivably
> be enough in this context to allow the total number of states to diverge
> and get you over the infinity barrier?

-- 
-----------------------------------------------------------------------
Anders Sandberg                                      Towards Ascension!
asa@nada.kth.se                            http://www.nada.kth.se/~asa/
GCS/M/S/O d++ -p+ c++++ !l u+ e++ m++ s+/+ n--- h+/* f+ g+ w++ t+ r+ !y
Received on Tue Dec 9 16:25:56 1997

This archive was generated by hypermail 2.1.8 : Tue Mar 07 2006 - 14:45:29 PST