Theorem A.4 — Conjecture A.3 is false: without a simulator with oracle cannot decide every decidable closed under
ProvedObfImpossibility.RiceNoSize.theorem_A_4Theorem A.4. Conjecture A.3 is false. That is, there is a promise problem — a pair of disjoint sets of Turing machines — that is closed under and decidable, such that no oracle machine satisfies
where is the output of given oracle access to the step-bounded function and nothing else.
Theorem A.2 shows that such an exists when it is also given ; Theorem A.4 shows that this extra input cannot be dropped, so the computability analogue of the virtual-black-box simulator needs an upper bound on the size of the program.
Formalization Note Machines are step-counted one-tape Turing machines with unary inputs, is the number of states, and oracle machines are uniform oracle programs run on the fixed input (see the setting file).
import Mathlib import Definitions.Def_ObfImpossibility_RiceNoSize_ProofObjects
namespace ObfImpossibility.RiceNoSize /-- Theorem A.4 (p. A:42): Conjecture A.3 is false. -/ theorem theorem_A_4 : ¬ ConjectureA3 := by sorry end ObfImpossibility.RiceNoSize
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.