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 113221
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
1
vote
1
answer
71
views
Prove that a set A is semi-decidable if and only if there is a polynomial time relation R(x,y)
I know if there is a decidable relation R(x,y) for x in A, then A is semi-decidable. But how can I prove the relation is polynomial time?
For R(x,y), x is where M is a TM, y is the accepting configu …
- 131
2
votes
2
answers
300
views
Is this set semi-decidable? A set of all <M> that M is a TM halts on all input strings w suc...
$A$ is a set of all $\langle M \rangle$ that $M$ is a TM halting on all input strings $w$ such that $\lvert w \rvert \le q(M)$ where $q(M)$ is the number of states in $M$.
Is $A$ semi-decidable? Is a …
- 131