Circuit Lower Bound: st Spec Tab
ProvedCircuitLowerBound.stSpecTabalgorithmsanthropic-eth-16a5ce4complexity-theory
The conditions are the shifts of 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_Frame import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Tab_Table set_option autoImplicit false section section open CircuitLowerBound open Tab Turing
Formal statement
theorem CircuitLowerBound.stSpecTab : StSpecTab := by sorry
Source