0 votes 0 votes Match the following 1.P 2.NP 3.NP-Complete 4. NP-Hard 1.Decidable 2.Undecidable Theory of Computation theory-of-computation + – srestha asked Dec 12, 2018 srestha 343 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply goxul commented Dec 12, 2018 reply Follow Share All of them are decidable. Undecidable problems have a different way of classification called as arithmetical hierarchy. See: https://en.wikipedia.org/wiki/Arithmetical_hierarchy 1 votes 1 votes ankitgupta.1729 commented Dec 12, 2018 reply Follow Share 1,2,3 are decidable .. But we can't say anything about NP- Hard..Halting problem is undecidable and it is NP- hard too..3-SAT is NP- hard but it is decidable... 1 votes 1 votes air1ankit commented Dec 12, 2018 reply Follow Share https://health.uconn.edu/bioinformatics/wp-content/uploads/sites/162/2017/11/Computation_Complexity_2016.pdf 0 votes 0 votes Shubhanshu commented Dec 12, 2018 reply Follow Share #### 0 votes 0 votes Please log in or register to add a comment.