This has no influence on the conceptual nature of the program in the machine (of course, it has considerable influence on the physical nature of the computer!).
In short, they were manifestations of the program, not of the machine that reads the program.
The objective is achieved in real time to compensate for the part deformations from the measurement of the cutting forces, without the programming of the tool path trajectories in the machine tool being affected.
While in the world of abstraction the program and the machine must be separated, in the concrete world they need to be somehow linked together.
It does not need instructions: the presence of the tape carrying the program in the machine is enough to trigger the process of reading and deciphering its message, followed by changes of states in the machine and associated actions.
Turing showed that he could build a Turing machine, \(U\), that was universal, in the sense that it could run the program of any other Turing machine.
Recently, Glaschick reverse engineered the program of one of these machines and found that it is a universal Turing machine.
Finally, we must note that the algorithmic approach, presented when considering the genetic program as an authentic program in a Turing machine (Danchin, 2003), identifies two completely different levels: the level of the program and the level of the machine.
In running these programs, the output of the machine would simulate, to any preassigned degree, the human activity as originally analyzed.
