cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

1994-03-31 - Crypto and new computing strategies

Header Data

From: solovay@math.berkeley.edu (Robert M. Solovay)
To: hughes@ah.com
Message Hash: 96112a1a3a8f0d4701a8b233ec630bd253fb78219fef62601dc0d9746018adbc
Message ID: <199403310048.QAA23096@math.berkeley.edu>
Reply To: <9403302118.AA00503@ah.com>
UTC Datetime: 1994-03-31 00:48:42 UTC
Raw Date: Wed, 30 Mar 94 16:48:42 PST

Raw message

From: solovay@math.berkeley.edu (Robert M. Solovay)
Date: Wed, 30 Mar 94 16:48:42 PST
To: hughes@ah.com
Subject: Crypto and new computing strategies
In-Reply-To: <9403302118.AA00503@ah.com>
Message-ID: <199403310048.QAA23096@math.berkeley.edu>
MIME-Version: 1.0
Content-Type: text/plain



hughes@ah.com writes:


>> The Bekenstein Bound gives limits both on the expected maximum number
>> of quantum states encodable in a given volume of space and on the
>> expected maximum number os transitions between these states.  If this
>> bound holds (and it certainly seems to hold for EM fields), then a
>> probabilistic Turing machine will be able to simulate it.

	Can you give a reference for this Bekenstein bound?

	Thanks,
  		Bob Solovay

Thread