  Alan Cobham and Jack Edmonds identified the complexity class, \(\P\), of problems recognizable in some polynomial amount of time, as being an excellent mathematical wrapper of the class of feasible  problems—those problems all of whose moderately-sized instances can be feasibly recognized,