←back to thread

New proof dramatically compresses space needed for computation

(www.scientificamerican.com)
190 points baruchel | 2 comments | 27 Jun 25 13:59 UTC | HN request time: 0.424s | source
Show context
kristianp ◴[30 Jun 25 10:28 UTC] No.44421565[source]▶
This seems very theoretical, just a lower bound on space required, without talking about what is being computed. Does it have any import on real algorithms?
replies(6): >>44421590 #>>44421702 #>>44421728 #>>44422242 #>>44422376 #>>44422969 #
1. wiz21c ◴[30 Jun 25 10:53 UTC] No.44421702[source]▶
Lower bound tells you how much it's worth to improve the SOTA. It gives you a hint that you can do better.

So it's more like polar star. Maybe not directly practical, but it will lead tons of people in the right direction.

replies(1): >>44421791 #
2. Gravityloss ◴[30 Jun 25 11:05 UTC] No.44421791[source]▶
Thanks. I think the title is quite misleading then? I would have expected better from Scientific American.