Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with turing-machines
Search options not deleted
user 72269
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
2
votes
Difference between Turing machine and Universal Turing machine
Every TM does just one task. It sums two input numbers, or it scans the input for some symbol, or it looks for a counterexample of Goldbach's conjecture ...
... or it (let us call it TM#1, since we w …
- 77
0
votes
Why does a Turing Machine need at least two states?
There is something to be gotten out of the computation.
Either you interpret the final tape contents (and you stop by the "HALT" command, not by going into an accept state, which you do not have), or …
- 77
-1
votes
Is there a TM that halts iff P = NP?
1 The problem is somewhat more complicated in spirit to Goldbach and similar problems (FLT, ZFC): You certainly can invent a TM that solves instances of 3-SAT (in exp time) as you can check instances …
- 77
1
vote
Goldbach Conjecture and Busy Beaver numbers?
The Goldbach conjecture can be falsified (if actually false) by such a TM program; it can not be proven correct in this way (an insightful mathematician, however, might do this).
Knowing BB(27) would …
- 77
0
votes
Do most bitstrings expand if they halt when executed by a Universal Turing machine?
Well, ...
several (different!) scenarios:
I assume that U is a (fixed) UTM, you give it a string s = (TM,input),
U(s) = TM(input) = either a finite output "f" or else DIS, the TM does not halt. Add …
- 77
1
vote
Does every turing machine have an equivalent, single-state, n-tape turing machine?
On all the comments:
Usually a TM is used to compute something, e.g. a yes/no about word \in language.
Therefore, either we are nit-picking and require at least two halting states (accept, reject) PLU …
- 77