3 ms·
I wonder if we can go to even higher density. From entropy constraints, computing performance asymptotically scales with surface area [0,1]. The general bound i
by ivalm 6y ago
I wonder if we can go to even higher density. From entropy constraints, computing performance asymptotically scales with surface area [0,1]. The general bound is Bekenstein bound[2]
[0] https://en.wikipedia.org/wiki/Black_hole_thermodynamics https://en.wikipedia.org/wiki/Black_hole_thermodynamics
[1] https://en.wikipedia.org/wiki/Holographic_principle https://en.wikipedia.org/wiki/Holographic_principle
[2] https://en.wikipedia.org/wiki/Bekenstein_bound https://en.wikipedia.org/wiki/Bekenstein_bound
- Filligree 6y agoThe bound exists, but it's so many orders of magnitude out that for all practical purposes we don't need to worry about it. Of course, however, heat dissipation presents similar challenges.
- elcritch 6y agoIt'll be interesting to see how/if quantum effects will be used in future computing tech (well aside from the whole quantum bangaps in semi-conductors). Effects like thermal super-conductors could enable much higher heat in a given area, perhaps built with quantum dots on semiconductors (IIRC, I thought some researchers tried that).