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 busy-beaver
Search options not deleted
user 72269
The Busy Beaver problem is about finding the sequence of n-state Turing Machines writing the most 1's on a tape.
3
votes
Wanted: Concrete Example of Busy Beaver Holdout
Skelet has 43 holdouts (those with type = ----).
At least No. 827123 (the very first in the lists) is still open, afaik.
My "feeling" is that all but 6 (no idea, which!) have been shown to be infinite …
- 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