Circuit Lower Bound: st Tab of
ProvedCircuitLowerBound.stTab_ofalgorithmsanthropic-eth-16a5ce4complexity-theory
Every machine has a table.
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_CircuitLowerBound_Tab_Spec import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Tab_Glue set_option autoImplicit false section section open CircuitLowerBound open ENP Turing Tab
Formal statement
theorem CircuitLowerBound.stTab_of (h1 : StPack) (h2 : StSpec) (h3 : StSpecTab) : StTab := by sorry
Source