Proof: visit poly
ProvedQueryMachines.Bridge.Proof.visit_polyalgorithmsanthropic-eth-16a5ce4complexity-theory
One round is polynomial-time.
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_ToTuring_PolyT import Definitions.Def_ToTuring_Closure_Fold import Definitions.Def_ToTuring_Lib_List1b import Definitions.Def_ToTuring_Lib_Nat1b import Definitions.Def_ToTuring_Lib_Bool import Definitions.Def_CountedToPadded_Compare set_option autoImplicit false section section open QueryMachines QueryMachines.Bridge QueryMachines.Bridge.Proof open Turing Groundwork Groundwork.TM Groundwork.PolyT
Formal statement
theorem QueryMachines.Bridge.Proof.visit_poly : PolyT visit := by sorry
Source