Self-Relative (or Machian) Information: Entropy-Area Relation
Nima Khosravi

TL;DR
This paper introduces a new counting method called self-relative information to explain the black hole entropy-area relation, supporting the idea that one bit of information corresponds to an area of , and predicts logarithmic corrections.
Contribution
It proposes a novel self-relative information counting method that explains the entropy-area relation with a fundamental bit area of , resolving a key question in quantum gravity.
Findings
Correctly reproduces the entropy-area relation with 1 as the fundamental area per bit.
Predicts the existence of logarithmic corrections to black hole entropy.
Provides a new perspective on information counting near black hole horizons.
Abstract
The entropy-area relation of black holes is one of the important results of theoretical physics. It is one of the few relations that is used to test theories of quantum gravity in the absence of any experimental evidence. It states that is the fundamental area that holds \textit{one} bit of information. Consequently, a question arises: why and not is the fundamental holder of \textit{one} bit of information? In any case it seems the latter choice is more natural. We show that this question can be answered with a more explicit counting of the independent states of a black hole. To do this we introduce a method of counting which we name self-relative information. It says that a bit alone does not have any information unless it is considered near other bits. Utilizing this approach we obtain the correct entropy-area relation for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
