|
Preprints of the Keldysh Institute of Applied Mathematics, 2005, 136, 32 pp.
(Mi ipmp777)
|
|
|
|
About difficulties of the calculations of the arithmetical proGrams
S. V. Popov
Abstract:
There are considered program on full base, computing binary all determined functions. It is proved; if function, computed by the program, possess entropy $H$, there is calculation of the program of the length $2_{dH}$ for positive constant $d$.
Citation:
S. V. Popov, “About difficulties of the calculations of the arithmetical proGrams”, Keldysh Institute preprints, 2005, 136, 32 pp.
Linking options:
https://www.mathnet.ru/eng/ipmp777 https://www.mathnet.ru/eng/ipmp/y2005/p136
|
|