Query Machines: st Poly Subst
ProvedQueryMachines.stPolySubstalgorithmsanthropic-eth-16a5ce4complexity-theory
StPolySubst holds: queries answered by a machine with query access and polynomial-time steps
give a machine with query access and polynomial-time steps.
Preamble
/- Copyright (c) 2026 Anthropic, PBC. All rights reserved. Released under Apache 2.0; SPDX-License-Identifier: Apache-2.0. Source and original notices: https://github.com/anthropics/formal-math/blob/16a5ce41304fcdaea4e0be7c132e1c361dc26da5/eth/NOTICE -/ import Definitions.Def_QueryMachines_Comb import Definitions.Def_ToTuring_Poly_Range import Definitions.Def_ToTuring_Poly_Comb import Mathlib.Tactic import Definitions.Def_QueryMachines_Poly set_option autoImplicit false section section open QueryMachines open Groundwork QueryMachine
Formal statement
theorem QueryMachines.stPolySubst : StPolySubst := by sorry
Source