mirror of
https://git.sr.ht/~seirdy/seirdy.one
synced 2024-11-13 01:02:10 +00:00
Add link to Bremermann's limit
Found via goldenkey on Hacker News.
This commit is contained in:
parent
831443c52c
commit
b60b478281
2 changed files with 11 additions and 4 deletions
|
@ -224,6 +224,9 @@ He uses an alternative approach to finding the maximum bits we can work with: he
|
||||||
|
|
||||||
This model takes into account more than just the mass of the observable universe. While we previously found that the MOAC can brute-force a password with 306.76 entropy bits, this model allows the same for up to 405.3 bits.
|
This model takes into account more than just the mass of the observable universe. While we previously found that the MOAC can brute-force a password with 306.76 entropy bits, this model allows the same for up to 405.3 bits.
|
||||||
|
|
||||||
|
Another well-known approach to calculating physical limits of computation is Bremermann's limit, which calculates the speed of computation given a finite amount of mass. This article's approach disregards time, focusing only on mass-energy equivalence.
|
||||||
|
|
||||||
|
=> https://en.wikipedia.org/wiki/Bremermann%27s_limit Bremermann's limit (Wikipedia)
|
||||||
|
|
||||||
## Acknowledgements
|
## Acknowledgements
|
||||||
|
|
||||||
|
|
|
@ -283,15 +283,19 @@ Further reading: an alternative approach
|
||||||
----------------------------------------
|
----------------------------------------
|
||||||
|
|
||||||
Check out Scott Aaronson's article, [Cosmology and
|
Check out Scott Aaronson's article, [Cosmology and
|
||||||
Complexity](https://www.scottaaronson.com/democritus/lec20.html).
|
Complexity](https://www.scottaaronson.com/democritus/lec20.html). He uses an
|
||||||
He uses an alternative approach to finding the maximum bits we can work with: he
|
alternative approach to finding the maximum bits we can work with: he simply inverts
|
||||||
simply inverts the [cosmological
|
the [cosmological constant](https://en.wikipedia.org/wiki/Cosmological_constant).
|
||||||
constant](https://en.wikipedia.org/wiki/Cosmological_constant).
|
|
||||||
|
|
||||||
This model takes into account more than just the mass of the observable universe.
|
This model takes into account more than just the mass of the observable universe.
|
||||||
While we previously found that the MOAC can brute-force a password with 306.76
|
While we previously found that the MOAC can brute-force a password with 306.76
|
||||||
entropy bits, this model allows the same for up to 405.3 bits.
|
entropy bits, this model allows the same for up to 405.3 bits.
|
||||||
|
|
||||||
|
Another well-known approach to calculating physical limits of computation is
|
||||||
|
[Bremermann's limit](https://en.wikipedia.org/wiki/Bremermann%27s_limit), which
|
||||||
|
calculates the speed of computation given a finite amount of mass. This article's
|
||||||
|
approach disregards time, focusing only on mass-energy equivalence.
|
||||||
|
|
||||||
Acknowledgements
|
Acknowledgements
|
||||||
----------------
|
----------------
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue