Cobham's thesis, also known as
Cobham–Edmonds thesis (named after Alan Cobham and
Jack Edmonds), asserts that computational problems can be feasibly computed on some computational device only if they can be computed in
polynomial time; that is, if they lie in the
complexity class P.