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 combinatorics
Search options not deleted
user 72269
Questions related to combinatorics and discrete mathematical structures
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