Is there a "good enough" solution for the halting problem?

Posted by EpsilonVector on Stack Overflow See other posts from Stack Overflow or by EpsilonVector
Published on 2010-03-18T00:00:45Z Indexed on 2010/03/18 0:01 UTC
Read the original article Hit count: 294

Filed under:

halting-problem

It is known that the halting problem cannot have a definite solution, one that a) returns true <==> the program does indeed halt, and b) handles any input, but I was wondering if there are good enough solutions to the problem, ones that can maybe handle certain types of program flows perfectly, or is able to identify it when it cannot correctly solve the problem, and so on....

If so, how good are they, and what ideas/limitations do they rely on?

Related posts about halting-problem

Turing machine halting problem

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I have a question about turing machines and halting problem. Suppose that we have Atm = {(M,w) where M is a turing machine and w is an input} and HALTtm = {(M,w) where M is a turing machine halts with an input w} I want to prove that HALTtm<=m Atm I've tried some methods but I think they're… >>> More
Is there a "good enough" solution for the halting problem?

as seen on Stack Overflow - Search for 'Stack Overflow'
It is known that the halting problem cannot have a definite solution, one that a) returns true <== the program does indeed halt, and b) handles any input, but I was wondering if there are good enough solutions to the problem, ones that can maybe handle certain types of program flows perfectly,… >>> More
Practical non-Turing-complete languages?

as seen on Stack Overflow - Search for 'Stack Overflow'
Nearly all programming languages used are Turing Complete, and while this affords the language to represent any computable algorithm, it also comes with its own set of problems. Seeing as all the algorithms I write are intended to halt, I would like to be able to represent them in a language that… >>> More
why there can't be a program that checks another program

as seen on Stack Overflow - Search for 'Stack Overflow'
Hello all I am trying to find the logical alan turing explanation why there can't be a program that checks another programs. I remember we learned in on the computation course but now i just can't find the solution , and i need to explain it to some one at my work . Thanks for help. >>> More
Theoretically bug-free programs

as seen on Programmers - Search for 'Programmers'
I have read lot of articles which state that code can't be bug-free, and they are talking about these theorems: Halting problem Gödel's incompleteness theorem Rice's theorem Actually Rice's theorem looks like an implication of the halting problem and the halting problem is in close relationship… >>> More

Developer IT

Is there a "good enough" solution for the halting problem? - Developer IT

Is there a "good enough" solution for the halting problem?

halting-problem

Related posts about halting-problem

Turing machine halting problem

Is there a "good enough" solution for the halting problem?

Practical non-Turing-complete languages?

why there can't be a program that checks another program

Theoretically bug-free programs

Categories cloud