Time complexity: the classes P and NP
Church’s thesis states that a function is computable iff it is recursive. A classical observation shows that some recursive functions require time of order O(22 2 n ) on inputs of size n. Such functions are not computable by any procedure producing an output in a reasonable time if n ≥ 10. Restrictions are needed to model the notion of effective computability.
KeywordsPolynomial Time Turing Machine Vertex Cover Computation Tree Global Relation
Unable to display preview. Download preview PDF.