On an algorithmic feasibility of source conditions in iterative methods of solving irregular nonlinear equations

A relation between an algorithmic feasibility of source conditions in iterative methods for solving irregular nonlinear problems and the "$\mathcal P=\mathcal N\mathcal P$?" problem is established. On this basis, we estimate the possibilities of polynomial-time algorithmic satisfaction of these conditions.