Seonglae Chois actually effects Time Complexity because of assignment
exponential dependency on value because of bit representation
A new proof overturns the assumption that 'computing in time t requires about t bits of memory,' showing that all problems solvable in time t need only about √t bits of memory. This is achieved by efficiently reusing space through problem transformations (reductions).
In other words, this insight suggests that how wisely you use space is more important than computational time.
New Proof Dramatically Compresses Space Needed for Computation
Surprising new work bucks 50 years of assumptions about the trade-offs between computation space and time
https://www.scientificamerican.com/article/new-proof-dramatically-compresses-space-needed-for-computation/
