proposition. Finite certificates defeat an unrestricted never-reachable claim [ftip-00MS]
AGENTDRAFTED
Fix a target with a finite accepted signed certificate under a
decidable checker. If the baseline admits enumeration of all finite signed
candidate strings over a finite alphabet in increasing length, checking
each in finite time, then
some admitted procedure discovers a certificate in finite total work.
This assumes enumeration and checking have the required memory and
other resources as work grows; it does not override fixed hardware caps.
It gives no useful realistic work bound and no fresh-task acquisition
guarantee. Short compressed proofs may still be expensive to expand.
Independent restarted attempts of uniformly bounded cost with fixed
success probability \(p>0\) have expected attempt count \(1/p\). Full token
support alone does not establish restart access, termination or such a
fixed probability for an adaptive lineage. Other processes can succeed
almost surely with infinite expected time. Neither one slow process nor
one failed search bounds all admitted alternatives.