PSPACE[0] is a computational complexity class, not about topology ("larger on the inside"). Any timemachine that produces self-consistent timelines (arrives at

PSPACE[0] is a computational complexity class, not about topology ("larger on the inside"). Any timemachine that produces self-consistent timelines (arrives at a fixed point after a finite amount of iterations) can be used to solve problems in PSPACE.[1] [0] https://en.wikipedia.org/wiki/PSPACE https://en.wikipedia.org/wiki/PSPACE [1] https://www.scottaaronson.com/papers/ctc.pdf https://www.scottaaronson.com/papers/ctc.pdf