Turing machine halting problem

Posted by iva123 on Stack Overflow See other posts from Stack Overflow or by iva123
Published on 2010-03-24T18:42:08Z Indexed on 2010/03/24 18:43 UTC
Read the original article Hit count: 508

Filed under:

turing-machines

|

halting-problem

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 far from the solution. Anyone can give some clues ??

© Stack Overflow or respective owner

Related posts about turing-machines

Turing machines of prime number

as seen on Stack Overflow - Search for 'Stack Overflow'
how to create a turing machine of prime number? >>> More
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
How to create a Turing machine that takes a single digit decimal number from 0 - 9 and output the cu

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm working on a project for a Turning machine but having problems conceptualizing the steps. f(x) = x^3, where x is a single digit between 0 - 9 inclusive. Based on my understanding I am to convert the number to binary but how do I find the cube of a number in binary. Also, how do I write the… >>> More
Turing Model Vs Von Neuman model

as seen on Stack Overflow - Search for 'Stack Overflow'
First some background (based on my understanding).. The Von-Neumann architecture describes the stored-program computer where instructions and data are stored in memory and the machine works by changing it's internal state, i.e an instruction operated on some data and modifies the data. So inherently… >>> More
How to work with this turing machine?

as seen on Stack Overflow - Search for 'Stack Overflow'
This is a screenshot of the applet LogiCell 1.0, link to which I found here. As the bottom left corner shows, this is doing sum 0+1 and the result is 01b (bottom right hand side). I am not able to link what is displayed to what the inputs ans outputs are. For example in this case - seeing the… >>> More

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