Talk:Bekenstein bound

From Wikipedia, the free encyclopedia

	Portal This article is within the scope of WikiProject Physics, which collaborates on articles related to physics.
Start	This article has been rated as start-Class on the assessment scale.
Low	This article is on a subject of low importance within physics.
Help with this template Comments: edit – history – watch – refresh Comments on article assessment. I think the article deserves a "low" status because 1. in the scientific community, the bound is still somewhat of a conjecture (perhaps proven for some matter contents, etc) and is a bit "hypothetical" (compare an article, on say, "atom") 2. it's generally of mostly specialist interest. I go for "start" class since there is a dead link or two (eg, "Planck area") and I think the article could do with a little more background, explanation for the non-expert reader, and perhaps links to other areas to help explain arguments -- especially in the last paragraph. The article could also be organized a little more: for example, a header followed by section(s). Wesino 00:45, 29 November 2006 (UTC)

[edit] Comparison with applied information density?

Would it be appropriate to state the maximum information density in bits per cubic meter (or cubic millimeter)? This looks like a straightforward calculation from the S = A/4 formula, but I don't know if there are gotchas in making this kind of comparison. I assume the applied kinds of densities in places like Computer storage density are many orders of magnitude from what is discussed here, but are there even deeper reasons why they are talking about two different things, or is it potentially comparable? (either a "yes" or a "no" might be good to add to the article). Kingdon 19:53, 25 May 2007 (UTC)

You sure would think this would be possible, but it's not. Information capacity is constrained not by volume, as you'd think, but by the area surrounding the volume. The consequence are deep: the holographic principle. PhysPhD 22:25, 25 May 2007 (UTC)

Hmm. Thanks for the answer. Kingdon 00:41, 27 May 2007 (UTC)