RAM+BOOL

Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP. The paper is dedicated to the memory of my teacher Nikolay Alexandrovich Shanin, who in his public speeches always emphasized the significance of research related to computational efficiency. During the last 30 years, many mathematicians working in the mathematical theory of computer science have begun to understand this efficiency as the computability in a polynomial number of steps by a Turing machine (the class FP).

References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Kosovskii, N.K.: Polynomial upper bounds on the size of changes of a RAM+BOOL program as a tool for proving belonging to FP (2014)