Interesting algorithm world --- Appendix (2)
Second to the determinism of algorithm
Some people say that the determinism of the algorithm should be determined by each step, or the execution is not a dismissal, the result should not be our unpredictable thing? This is also telling it from a microscopic, I don't think there is no uncertainty. It is uncertain in one step. The result is completely exceeded in our prediction, just like integer group
I think the "deterministic" and "uncertainty" are now in the actual operation. This step to the next conversion, you can predetermine. For example:
For i: = 0 to N-1 DO
Sum: = SUM A [I];
Any one step to the next conversion is linear, can be unique. But such as genetic algorithms, the next generation of populations cannot be determined before the specific implementation, there are many possibilities, that is, this step to the next step, Not a linear relationship. We call non-deterministic.
Regarding this problem, netizen Dream_soft said the random essential problem. Of course, we know that the random number of computers is "pseudo-random", through a certain algorithm, different from the real random. But what is true random This is another philosophical problem. We don't say it.
Third on Algorithm and Program Design Method
Netizen DORCOM mentioned algorithms and programming, with language system, or said, algorithm and programming methodology.
We know that programming methodology is the discipline of research program design theory. We used to design, there is a stage of the machine code (huh, J, quite hard), and then there is a process process design, structured program design, to now Object-oriented programming, large-scale program design methodology, etc. Indeed, the progress of the theory of programming methods, helping us solve many problems. Our program is convenient, high efficiency, good portability, reusable Sex, easy to maintain, but it is not the same problem on the algorithm.
So no one can replace anyone. No matter where, as a computer science and technician, we must master it.
Four things about some mistakes
The article is what I am playing. There is no discrepancy, so there is such a mistake, please forgive. Especially the netizen ZCR139, CADINFO, etc. Thank you very much for indicating my mistakes and errors.
Five About Writing Plan and Reference
When I think about these articles, I will prepare:
(1) Summary, blow up the horn j.
(2) What is the algorithm, one, some of the definitions of the algorithm and the characteristics of the algorithm. The definition of the algorithm refers to the << intelligent calculation and application of the Kangli Mountain. It is unfortunately this information is the internal information of our school. It is a good book for parallel computing and evolution, but it cannot be seen for everyone.
(3) The root of the algorithm, the plan, the essential problem of the algorithm by the Hilbert problem, by the algebraic structure and the poor self-motivation. After introducing various map foreigners, the algorithm tree in my heart is introduced, explaining that this The roughly route of the trip. Among them, the map spirit is defined and related examples, and the book is referred to << Calculation Theory Guide >> (Mi Michael Sipser, Zhang Lang and other translation).
In this way, our first part can be over. Finally, thank you. I am grateful to the netizens who encourage my netizens, I am grateful for criticism, I am grateful, and for those who like algorithms, prepare for fine reading. Netizen, huh, I am admired ~~~~
Post: It is because it is not possible to post it .j.
Oh, why should you limit it?
