Abstract
What can be Computed is a textbook for a course that covers Decidable Languages, Computable Functions, Recursively Enumerable Languages, Turing Machines, Reductions, Regular Languages, P, NP, and NPcompleteness. Since there are already many books with these topics in them, the question is:
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have