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 168475
Questions about Turing machines, a theoretical model of mechanical computation capable of simulating any computer program.
0
votes
Reduction from $HALT$ to $A_{TM}$
Your solution looks correct. I have a concern that since we have assumed a decider for ATM, so M will either accept any word 'w' or reject it; in either case our constructed decider for HaltTM would o …
0
votes
Is the Rice Theorem applicable for these problems?
Just a rule of thumb:-
Rice's theorem concerns properties of languages, not the Turing machines.
Consider property P as the set of some R.E. languages, P is nontrivial if it does not contains all R.E. …