Image:Pinterst |
The problem with binary computers or Turing's machines is that they must stop before they start their next mission. That is one of the reasons why the development of quantum computers started. In quantum computer is enough, when one of its layers stopped for taking the mission or code in it. There is of course problem that the inputting data to the quantum processor fail.
Because there is the possibility the support system tries to download data to the busy layer. The stopping problem is the thing that makes the system slow. The problem is that we cannot see outside is Turing's machine ready for the next program.
If the machine is running and handling some other program, that thing will turn Turing's machine out of control. It's like trying to put another tape in the movie projector which uses film while it's running. The film will be lost. And if that thing happens in the computer every data is lost. And if the calculation is lasting weeks. That thing can cause loss of invaluable information. So how to solve the stopping problem?
In this version, the CPU can automatically tell the system it's ready for the next algorithm. In that case, the end and beginning of the code-line are equipping with the mark. That mark in the code tells that the code is beginning and when it's ending. When the CPU will see the algorithm's beginning mark. It's telling other processors that it's busy. That makes it easier to control the system. Because other processors must not all time ask if the processors are busy.
This means that the data would transfer to other processors. And when the end of the program is seen. This means that the CPU will tell that it's ready for the next mission.
One of the versions for the solution is that the system uses the control processor. That means the control or auxiliary processor keeps the book when the microprocessor is taken the data under processing. And when that data is coming out the processor is free. But then we might think that the processor will use the preprocessed information. In this version, the system uses the auxiliary processor for marking the beginning and the last point of the data flow.
When the data is downloaded to the CPU the processor will get the mark that it can start its run. And if there is some kind of series. There are orders of how many times the program has access to run through the microprocessor. And that means when the program is run let's say about 5000 times, it will get an end mark. In that case, the system has promised the program 5000 drives. When the end mark of the program comes that processor can automatically report to the control processor that the system is ready for the next program or code line.
The answer is that the multiprocessor model of Turing's machine must not stop entirely. If it uses multiple microprocessors it's enough that only the microchip that takes the algorithm is stopped. The system would partially be stopped because there is always be a free microprocessor. That is ready to receive the data.
But the most powerful thing in binary computers is to use the so-called "non-linear stopping method". In this version, the system uses multiple microprocessors. And the data would be driven to the free microchip. The non-linearly means that while another processor is working the other will be ready for the mission. The idea is that some of the processors are working with the algorithms.
()https://kimmoswritings.blogspot.com/
Comments
Post a Comment