-
as seen on Stack Overflow
- Search for 'Stack Overflow'
I heard a lot that modern computers are based on Turing machine. I'd like to share my understanding and hear your comments.
I think the computer is a big general-purpose Turing machine. Each program we write is a small specific-purpose Turing machine. The classical Turing machine do its job based…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
If I have a machine, call it machine 1, that is able to solve a problem: it's just a machine, not persé a Turing machine. It can solve one specific problem.
If this exact same problem can be solved on a Universal Turing Machine, then is my original machine, 1, a Universal Turing Machine too?
This…
>>> More
-
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
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Greetings,
I have been struggling to find a question regarding this theoretical question, even tho it is not directly a programming question, I believe it is really related.
Assume a type of Turing machine which cannot have more than 1000 squares. What would be the relationship between the set…
>>> More
-
as seen on Stack Overflow
- Search for 'Stack Overflow'
Whilst doing exam revision I am having trouble answering the following question from the book, "An Introduction to the Theory of Computation" by Sipser. Unfortunately there's no solution to this question in the book.
Explain why the following is not a legitimate Turing machine.
M = {
The input…
>>> More
