| Popis: |
theoretical redundancy of the proof theorem about data processing algorithmic complexes’s combinatorial linearization [ 1 ] opens additional heuristic possibilities for decision of this problem. The correlation between theory and heuristics is illustrated in article on concrete examples. It had been shown, that heuristic transformations of DPAC’s mathematical models are able not only correspond to theoretical recommendations, but also break them, realizing, nevertheless, the purpose of combinatorial linearization itself. As a hole, the heuristic approach widenes possibilities of DPAC’s combinatorial linearization, that is essential for applications. |
