Delete comment from: Computational Complexity

William Hoza said...

For the record:

- Yes, my best guess is that it will take another 50 years to prove L = RL, but I'm not confident it will take that long. I consider it plausible that someone will discover a proof tomorrow.

- I wouldn't be surprised if someone discovered a proof that RL is contained in DSPACE((log n)^{1 + o(1)}) within the next 10 years.

Oct 7, 2018, 3:57:52 PM

Posted to Still Typecasting from Dagstuhl