In our recent research we studied a feasibility problem with infinitely many sets in metric space, presented novel algorithm and analyzed its convergence. the present paper study introduced that work for common fixed taking into account computational errors. We show generates good approximate solution, if errors are bounded from above by small positive constant.