Live data from Hacker News

How do black holes destroy information and why is that a problem?

backreaction.blogspot.com

91–93 of 93 posts

Re: How do black holes destroy information and why is that a problem?

#91

Earlier quoted context omitted.

|a| = 2 a^2 = 4

Most functions are not invertible. In modulo arithmetic (numbers wrap around like days of the week, months, hours in a day, or the units column, e.g. mod 10 has numbers 0 to 9, and 9+1=0) we can count them. There are n^n possible functions (each of the n inputs could map to any n values), but only n! invertible functions (the first input can be to any of n , the second can be to any but the first's, etc (n)(n-1)(n-2)…

Stirling's approximation says that n! ~ sqrt(2 pi n) (n/e)^n.

So n!/n^n ~ sqrt(2 pi n)e^-n.

Re: How do black holes destroy information and why is that a problem?

#92

Earlier quoted context omitted.

Most functions are not invertible. In modulo arithmetic (numbers wrap around like days of the week, months, hours in a day, or the units column, e.g. mod 10 has numbers 0 to 9, and 9+1=0) we can count them. There are n^n possible functions (each of the n inputs could map to any n values), but only n! invertible functions (the first input can be to any of n , the second can be to any but the first's, etc (n)(n-1)(n-2)…

Stirling's approximation says that n! ~ sqrt(2 pi n) (n/e)^n. So n!/n^n ~ sqrt(2 pi n)e^-n.

Cool! So the 1/e^n factor will bring it to 0, as n goes to infinity, I think?

Re: How do black holes destroy information and why is that a problem?

#93

Earlier quoted context omitted.

Stirling's approximation says that n! ~ sqrt(2 pi n) (n/e)^n. So n!/n^n ~ sqrt(2 pi n)e^-n.

Cool! So the 1/e^n factor will bring it to 0, as n goes to infinity, I think?

Yeah, e^n grows much faster than sqrt(2 pi n), so sqrt(2 pi n)/e^n will tend to 0.
Post reply on HN