|
|
|
|
|
|
by tsimionescu
1770 days ago
|
|
|
There are programs for which we can check this, but there is no general procedure to check if any program halts. Even ignoring the halting problem itself, say we analyze a program and realize it halts iff P=NP, or pi to the e is transcendental, .or if Pi's decimal expansion at position Graham's number is divisible by 3. Will that program halt? It might be very hard to say. More promisingly, there are ways to construct programs such they will halt, using total languages (though not every problem can be solved with such a limitation). |
|
|