Remarks on Computer Simulations Based on Algorithms of High Complexity

Abstract

There are formulated several remarks concerning simulations of problems modeled by algorithms of at least exponential complexity using random generators for initial data. The stress is laid on the problem of estimation by means of simulation methods, the average length of computations.