Physical Complexity of Algorithms

The article analyzes the complexity of the first kind algorithms. The first kind’ algorithms features are investigated. A new concept is introduced in the theory of algorithmic complexity “algorithm efficiency” and “physical computation time”. A new concept in the algorithmic complexity theory “physical complexity of the algorithm” is introduced. The difference between the first and second kind algorithms is shown on the deterministic and non-deterministic Turing machines example. A first kind algorithms generalized model is given. The conventionality of complexity’ some types are noted. It consists in the fact that algorithms that belong to the same complexity class or type of complexity physically use different computation times. A situation is noted in which a complexity simpler type spends more time on computations than a more complex one. The algorithmic complexity existing theory lack is noted - the calculation result and cognitive complexity quality exclusion from the complexity analysis. The complexity’ existing theory focuses on computation and computation time. The main thing in the computations is the result. If the computations’ result is not high-quality or unclear, then the computation time loses its importance. Accordingly, the complexity classes assessment should be tied not only to time but also to the resulting quality. The algorithm physical complexity takes into account the computation result quality #CSOC1120.