Tower: self Call Poly
ProvedQueryMachines.Tower.selfCallPolyalgorithmsanthropic-eth-16a5ce4complexity-theory
selfCall M has polynomial-time steps, once and for all depths of the recursion, if M has.
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_Tower_Defs import Definitions.Def_QueryMachines_Poly import Definitions.Def_ToTuring_Lib_List1b import Definitions.Def_Tower_Poly set_option autoImplicit false section section open QueryMachines QueryMachines.Tower open Groundwork Groundwork.PolyT QueryMachines.QueryMachine
Formal statement
theorem QueryMachines.Tower.selfCallPoly : SelfCallPoly := by sorry
Source