Savitch's Theorem (Complexity Theory), Statement and Proof

[@EasyTheory]

Thanks to Micah Wood (Platinum), and Josh Hibschman, Timmy Gy, Patrik Keinonen, and Travis Schnider (Silver) for helping support this video. If you want to contribute, links are in the video description.

[@judgebot5943]

just brilliant mate. Kind of content youtube was made for . Enjoyed every bit of this video

[@boazbar-david182]

Brilliant, thank you!

[@emperorzurg7258]

Thank you so much.

[@eugut]

In 4:40 Shouldn't be space=d^(2^(f(n))?

[@brendawilliams8062]

Thankyou. Are you using a reverse at some Turin machine state

[@sambhunathdey4367]

Fine demonstrations.
Is it true for n dim space ?

[@pinacolada6879]

is f(n) in this case log n? because the space can be seen as SPACE(f(n)^2) and the reachability should bein SPACE(log^2 n)...?

[@AliAhmadi-u7v]

Can anyone please explain why depth is 2^ O(f(n))?

[@DannyPhantumm]

You would have got my subscription, but too many ads man. Isn't the typical YT approach to build a sizeable subscriber count before monetizing?

[@6Pope9]

what do u know about it lol

[@brendawilliams8062]

I’d still try but not everyone abstracts the same