RUS  ENG
Full version
JOURNALS // Preprints of the Keldysh Institute of Applied Mathematics // Archive

Keldysh Institute preprints, 2001 017 (Mi ipmp1069)

Algebraic approach to define complexity

A. V. Vorozhtsov


Abstract: Algebraic way to define complexity is the key point of this article. You find here one rather abstract approach with lots of applications, — it is the method to endow a set, satisfying certain conditions, with binary relation, which can be named ‘complexity’. It is naturally applied to different sets of maps, although structure of calculable functions is easily defined at a set of convex figures, natural numbers, information channels and other objects.



© Steklov Math. Inst. of RAS, 2024