Simulating Time With Square-Root Space · HackerPapers discussions

Simulating Time With Square-Root Space — mentioned by kburman

Sat, 21 Mar 2026 11:56:36 GMT

https://arxiv.org/abs/2502.17779

Paper and discussion history. A mention is not an endorsement.

Simulating Time With Square-Root Space — HN submission

Tue, 15 Jul 2025 01:35:48 GMT

Simulating Time with Square-Root Space

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Simulating Time With Square-Root Space — mentioned by LegionMammal978

Mon, 30 Jun 2025 13:27:03 GMT

The author of the paper also notes how the result gives an upper bound for how well we can 'trade space for time' in the worst case: > In this paper, we make another step towards separating P from PSPACE, by showing that there are problems solvable in O(n) space that cannot be solved in n^2/log^c n time for some constant c > 0. [0] Of course, this is all specifically in the context of multitape Turing machines, which have very different complexity characteristics than the RAM machines we're more used to. [0] https://arxiv.org/abs/2502.17779

Paper and discussion history. A mention is not an endorsement.

Simulating Time With Square-Root Space — mentioned by trueismywork

Mon, 30 Jun 2025 08:39:12 GMT

https://arxiv.org/abs/2502.17779 Link to paper

Paper and discussion history. A mention is not an endorsement.

Simulating Time With Square-Root Space — HN submission

Fri, 20 Jun 2025 14:42:04 GMT

Simulating time with square-root space

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Simulating Time With Square-Root Space — HN submission

Sat, 07 Jun 2025 21:39:50 GMT

Simulating Time with Square-Root Space

20 points; 1 discussion reply on HN. Paper and source history. A submission is not an endorsement.

Simulating Time With Square-Root Space — HN submission

Sat, 07 Jun 2025 21:38:48 GMT

You need much less memory than time

https://arxiv.org/abs/2502.17779

126 points; 11 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Simulating Time With Square-Root Space — mentioned by cperciva

Wed, 21 May 2025 20:24:10 GMT

Minus the fuzz: A multitape Turing machine running in time t can be simulated using O(sqrt(t log t)) space (and typically more than t time). https://arxiv.org/abs/2502.17779

Paper and discussion history. A mention is not an endorsement.

Simulating Time With Square-Root Space — HN submission

Fri, 28 Mar 2025 07:32:24 GMT

Simulating Time with Square-Root Space

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Simulating Time With Square-Root Space — HN submission

Wed, 26 Mar 2025 22:36:04 GMT

Simulating Time with Square-Root Space

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.