Solutions to the Halting Problem
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. The halting problem is undecidable, meaning that no general algorithm exists that solves the halting problem for all possible program–input pairs. The problem comes up often in discussions of computability since it demonstrates that some functions are mathematically definable but not computable.
As stated, the solution to computability is not available in terms of the Halting Problem as the set-up to this problem is only intrinsic to the program itself and to the input given. Yet the machine that facilitates the computation is not given its due consideration, and in the sense that it alone does not have a self-perpetuating source of energy, a machine that runs forever is, perhaps, no better realized than a perpetual motion machine is, which means, so considered, that the machine ... also serves to determine the halting problem,
To stop the machine is to stop the program and to stop the input.
With such insight, we fast realize that both the program and the input are machine dependent, and that such a machine is itself dependent on a variety of other factors.
The Halting Problem, thereby, has a double in the Trolley Problem.
We stop a machine, a program, and/or an input by means of intervention, either directly or indirectly.
We indirectly stop a machine, a program, and/or an input by creating a dependency on a particular condition or by creating dependencies and/or co-dependencies that establish parameters, which serve to stop a machine, a program, and/or an input.
Comments
Post a Comment