It might be because of the name but many graduate students find it difficult to understand $\textsf{NP}$ problems. So, I thought of explaining them in an easy way. (When explanation […]
Theory of Computation
Some Reduction Inferences
How to solve problems by reduction?
Grammar: Decidable and Undecidable Problems
Decidable and undecidable problems on context free grammars.
Closure Property of Language Families
Closure Properties of language families
Discussion on Decidability
GATE CSE discussion on decidability portion of theory of Computation
You must be logged in to post a comment.