Who are you, the algorithm?

Today it is quite easy to come across unscrupulous school textbooks, in particular, computer science textbooks. In the chapters on algorithms, you can find the definition of an algorithm directly. Not an explanation of what it is about, not a story about a subject, but a definition. Moreover, it is highlighted in bold, carefully framed and marked with some noticeable pictogram in the form of an exclamation mark. Usually, all this is seasoned with a sauce from a heap of required and optional properties, forming as a result an enchanting mess. Let's try to understand what an algorithm is, why we cannot give it a specific definition, and find out which properties are required and which are not.





It is easy to understand the compilers of the textbooks, because in fact there is no strict definition of the algorithm, and moreover, there cannot be such a definition. But instead of trying to explain what's what, the authors slip the poor students another task of cramming useless and incorrect terms. In order not to be unfounded, I will give an excerpt from one very common textbook:





Things are better at universities, but the author of these lines in the course on mathematical logic and theory of algorithms had to face the same vinaigrette from the definition of an algorithm and its properties. Let's figure out what is wrong here.





To infinity and beyond

. , — , . . , : , -. ( 1 , 2 ..), - ( , - 1, - -1, k 2k, -m 2m + 1). - , ( m/n, m - , n - ). , , , , , , . «» () ℵ0 (-).





( ). , . , 1, 2 .. . ! .





, . , m/n. 1/3 2/7 , «" . 21 , , , 1/2 ().





, , ℵ1 (-).  . ( ). A*. , , ( ). 





?

: , , .. - , , , (, ). , , , 12- . , , , ! , ? ? , . , , , — . , .





. , , , N, N+1. , « »: , . 





 

— . , , . . , , A*. . , . , . , . , . , A* -> A* . , , . 





, , , . , , . , , . 





, . , , , , — . . 





-

, 1900 . , ( ) , . , , , , , . 





Kurt Gödel is best known for formulating and proving 2 incompleteness theorems.  By the way, he did it at the age of only 24 years.
, 2 . , 24 .

, , ( « » ). , , , - . , (, , ) , ( , ). «» , . . - , , , -. , , , :





- .





. , . -, , « », -, , . , , , - . , . 





      - ,   - (  ).     .      ,      A(4,4)     .
- , - ( ). . , A(4,4) .

. , ( ) . , A*->A*. , , , « ». , . - , . , , , . :





, , , .





: ( , , ) . -, . 





        .
.

, , -, , .





, . , . , . .





. . , , , . .





. , , . , , .





. , . , — , , . 





. , . , . . , .





«»        .
«» .

, , . . , , . , , «Hello world». , . 





, . . , . , , , . .  «« — , , , . , , , , . , . .





, , - — - . . . « » while , , , - -.





. , (- , , - ..). . . . , ( Haskell ), , , -, « », . 





 

, . , , . , , , , .





1- «: » . . . , , , , « » . .






- ITSOFT — - . UPTIME 100%. GPU- ASIC-, GPU-, , SSL-, .








All Articles