Transfer of native polynomial-time machines to physical oracle machines
ProvedAPSCounting893.Main.native_polynomial_simulationLet be any oracle language. Native deterministic polynomial-time computations over binary words transfer to the finite oracle-machine model:
and, for a Boolean-valued function ,
The native input encoding is the word itself; its Boolean output encoding is a singleton word. Native polynomial time means a fixed deterministic binary multitape machine with finitely many states and polynomially bounded transition count. The destination uses the actual finite oracle machines of this development, and word-valued outputs are read from the charged physical output tape. The same destination machine and polynomial handle every input length. No oracle is needed by the transferred computations, so the conclusion holds for every .
This interface permits the reusable native arithmetic, list and bounded-iteration algorithms to be used in the circuit and certificate procedures of Section 6.
import Definitions.Def_APSCounting893_Main_CountingHierarchy import Definitions.Def_Complexitylib_0ebd467_Computability_Machines_Turing_MultiTape_PolyTime import Definitions.Def_Complexitylib_0ebd467_Computability_Machines_Turing_MultiTape_Encodings_List import Definitions.Def_Complexitylib_0ebd467_Computability_Machines_Turing_MultiTape_Encodings_Bool set_option autoImplicit false open APSCounting893.Main
theorem APSCounting893.Main.native_polynomial_simulation :
(∀ (f : Word → Word),
Turing.MultiTapeTM.ComputableInPolyTime f Turing.MultiTapeTM.encBits Turing.MultiTapeTM.encBits →
∀ A : Language,FunctionInPWithOracle A f) ∧
(∀ (f : Word → Bool),
Turing.MultiTapeTM.ComputableInPolyTime f Turing.MultiTapeTM.encBits Turing.MultiTapeTM.encBool →
∀ A : Language,InOracleP A (fun x=>f x=true)) := by sorry