Algorithm of life

What is an algorithm?

In the year 2012 when the Nobel Prize for Economics went to lioyd shapley. In fact, the reason was rather strange, and made us excited to know him.

Shepley was one of the few scientists who could solve the so-called Stable marriage Problem by discovering algorithm in order to solve marriage problems and the way people marry so that there is no separation between husbands:

The word Algorithm is from the mathematician AL-KHAWARIZMI, which means a set or a series of steps that must be followed to solve a specific problem.

• The steps that SHAPLEY adopted in that Algorithm are used by countries such as China, Spain, and Germany to determine which students will be associated with any university in their choice schedule. In Britain, the National Helth Service uses them to reconcile patients who need kidney transplants with donors who have matching kidneys.

You are to read this great article. There are photons coming out of the fiber-optic servers under the ground in order to reach you dear reader.

In fact, Algorithm SHAPLEY is not the only Algorithm to have been a world of puzzle-like questions

Every time you wait for the traffic light to turn green or take a picture to post it on Instagram or withdraw money from the ITM machine, you are in one way or another following Algorithm

A series of steps to solve the problem of distributing goods or solving traffic crises, I took these steps and translated and programmed into a computer code IF LOOPS and SEMI-COLONS moving electrons in circles, if you think with me a little bit we will find that Algorithm that is in the form of talismans is not different from the magic solution.If you have a problem, type Algorithm to solve it.
Unfortunately, life is not the easy and beautiful way that I brought it up.
We know that there are some unresolved problems like Halting Problem, as ALAN TURING is the godfather of the computer and the man who we can say was the reason behind Britain's victory in World War II. It was proven in 1936 that Algorithm could not solve the Halting Problem. This is an unsolvable problem

Halting Problem very simply. If we have Algorithm and we want to know that this Algorithm (always looking for the optimal solution) will he still look to infinity or will he reach a solution

So we need Algorithm who can tell us that the first Algorithm will reach a solution or will search for an infinite

ALAN TURING has proven that no Algorithm can tell us whether a second Algorithm will reach a solution or remain in circles

Not any problem that we know has a solution that we can solve. In other words, even if we have a specific Algorithm, this does not mean that the problem is solved

Because there are Algorithm or complex methods of solution to the point of making them completely invalid

In 1962 Protect Sgamble, a $ 10,000 award-winning flyer, answered this question

We have 33 cities in different states in the United States American, and we want to visit all these cities, each one of them once and visit them in the order that makes the distance the shortest thing possible.

In fact, it is possible to bring a computer to try all possible methods and choose the shortest path, but how many possible methods

The first city we will visit will be one of 33 possible options. And every one of them can visit the first, there are 32 of the remaining two cities as a second shrine and 31 as a third shrine and so on ... meaning the number of possible arrangements.

Calculating 10³⁷ possible solutions, if we take these forms and put them in the fastest computers in the world so that he tests all the possibilities he will find their solution in 300 billion years.

This issue is known in the scientific community as TRAVELING Salesman Problem and it is classified as NON-determnistic polynomial.

So we have two types of problems

NP, which Algorithm does not have to solve, or takes many years to reach a solution
P  ,polynomial problems that can be solved by Algorithm are easy

I hope you like this article, and thanks for watching