in Theory of Computation
1,326 views
0 votes
0 votes

In Shai Simonsons video lecture series , the last few videos are titled as follows : 

Complexity Theory, Quantified Boolean Formula,Savitchs Theorem, Space hierarchy ,Decidability and complexity relationship,recursion theorem

Are any of these part of GATE syllabus ??

in Theory of Computation
1.3k views

1 Answer

1 vote
1 vote
Best answer
Decidability and complexity relationship,recursion theorem are important. But not all in the lecture. So leave them,read these topics from the book ullman.
selected by

Related questions