Algorithm and intuition.
Once again the different nature of information processing in the Central Asian type of combinational circuits (CC) and CA with memory.
In combinational circuits the output word is formed from the input speed signal propagation through the circuit. This occurs in one clock cycle.
In machines with memory holds information processing, which decays into units, each of which is performed within one clock cycle and can be described in terms of COP. With this process and related concepts of information processing algorithm. (The word "algorithm" comes from the name of the famous mathematician of the IX century Al-Khwarizmi, who formulated the rules of arithmetic operations on numbers.)
In mathematics, the widespread definition of the algorithm as the exact requirements of a finite sequence of unambiguous, understandable actions aimed at achieving this goal, starting from some initial data.
This definition will specify particular:
1. Algorithms are created for artists who are interested in the outcome, and no details of the process of solving the problem. Even when the algorithm created "for himself", the aim is to speed up and simplify the solution, so that it can be done without hesitation, "automatically".
2. A separate algorithm is often part of a more complex algorithm. Thus, an algorithm for solving a quadratic equation based on the auxiliary algorithms of algebraic operations on numbers. In general, the solution to any complex task is greatly simplified if it can be reduced to a sequence of subtasks. This is especially makes sense if the subtasks are typical for a wide range of other tasks.
3. Any algorithm is discrete, i.e., breaks down into a sequence of instructions designed to perform some basic actions or operations. These requirements should be clear to the Executive. Figuratively speaking, the performer must be proficient in the language of the description of the algorithm; otherwise it requires the services of a good translator.
4. Artist must be able to correctly perform all the elementary actions contained in the algorithm.
5. Algorithms are usually characterized by mass, i.e. applicability to a variety of source data. The solution to any problem "in general" on the merits is always a certain algorithm.
6. Finally, the algorithm should be efficient, i.e., lead to the goal in a finite number of steps. If the process ends without result or decision does not end at all, then we say that the algorithm is not applicable to obtain the source data.