Feasible computations and provable complexity properties | lit.salon