Investigation of complexity of computation of recursive programmes based on specific criteria

The symbolic computations of recursive programmes were investigated with the aim of study of complexity of computations in recursive programmes and in the language of recursive programming PROLOG. As a result a universal principle of determination of the criteria of complexity of recursive computations was suggested. The theory of complexity of computations of recursive patterns was developed. New semantics of the computational models was determined. The theorems on memory optimization were proved. Fast algorithms for the solution of tasks in functional computational models were found. A system of transformations of determined programmes in the language of PROLOG in iterative form was built up. The results obtained were introduced into practice. They may find their field of application in computation theory, logical programming, computerization of programmingAvailable from VNTIC / VNTIC - Scientific & Technical Information Centre of RussiaSIGLERURussian Federatio