Holdouts lists: Difference between revisions
Jump to navigation
Jump to search
(Added first entry for 4x3 holdouts) |
Jacobzheng (talk | contribs) No edit summary |
||
Line 21: | Line 21: | ||
|0 | |0 | ||
|6 | |6 | ||
| | |460,916,384 | ||
| | | | ||
| | | | ||
Line 60: | Line 60: | ||
|[https://discord.com/channels/960643023006490684/1084047886494470185/1320172124509311004 December 21, 2024] | |[https://discord.com/channels/960643023006490684/1084047886494470185/1320172124509311004 December 21, 2024] | ||
|@tjligocki | |@tjligocki | ||
| | |460,916,384 | ||
|[https://drive.google.com/file/d/1hKy0TuPuI62rN95j6ZLjXgE-Pue8tRsK/view?usp=drive_link 4x3_holdouts_460916384.txt.gz] | |[https://drive.google.com/file/d/1hKy0TuPuI62rN95j6ZLjXgE-Pue8tRsK/view?usp=drive_link 4x3_holdouts_460916384.txt.gz] | ||
|[https://drive.google.com/drive/folders/1HBPZ17llVE_8wCy5FvRUFQ5MJsaYXAW-?usp=drive_link Google Drive directory for 4x3 TMs] | |[https://drive.google.com/drive/folders/1HBPZ17llVE_8wCy5FvRUFQ5MJsaYXAW-?usp=drive_link Google Drive directory for 4x3 TMs] |
Revision as of 08:18, 22 December 2024
A holdout (or undecided machine) is a Turing machine for which it is not known whether the machine halts or not from all-0 input tape. Holdouts are the machines which deciders are unable to decide.
Holdout lists are often shared by contributors. Here is a table that summarises the number of holdout per busy beaver domain:
2-state | 3-state | 4-state | 5-state | 6-state | |
---|---|---|---|---|---|
2-symbol | 0 | 0 | 0 | 0 | 4408 |
3-symbol | 0 | 6 | 460,916,384 | ||
4-symbol | 0 | 434,787,751 | |||
5-symbol | 273 | ||||
6-symbol | 22,302,296 |
Downloadable lists
Georgi Georgiev (Skelet) posted a list of 43 holdouts for BB(5) in 2003. bbchallenge.org successfully reduced the number of holdouts for BB(5) to zero in June 2024.