Holdouts lists

From BusyBeaverWiki
Revision as of 13:02, 14 June 2024 by Cosmo (talk | contribs) (Created page with "A holdout (or undediced machine) is a Turing machine for which it is not known whether the machine halts or not from all-0 input tape. Holdout lists are often shared by contributors:")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A holdout (or undediced machine) is a Turing machine for which it is not known whether the machine halts or not from all-0 input tape.

Holdout lists are often shared by contributors: