Cobham's Thesis

All Updates

Formally, to say that a problem can be solved in polynomial time is to say that there exists an algorithm that, given an

Alan Cobham's 1965 paper entitled "The intrinsic computational difficulty of functions" is one of the earliest mentions of the concept of the complexity class P, consisting of problems decidable in polynomial time. Cobham theorized that this complexity class was a good way to describe the set of feasibly computable problems. Any problem that cannot be contained in P is not feasible, but if a real-world problem can be solved by an algorithm existing in P, generally such an algorithm will eventually be discovered.

The class P is a useful object of study because it is not sensitive to the details of the model of computation: for example, a change from a single-tape Turing machine to a multi-tape machine can lead to a quadratic speedup,...

Read More

No messages found

Suggested Pages
**Tell your friends >**

about this page
** Create a new Page**

about this page

for companies, colleges, celebrities or anything you like.Get updates on MyPage.

Create a new Page