ENP: all Decided
ProvedENP.allDecidedalgorithmsanthropic-eth-16a5ce4complexity-theory
Every set of words of length n is decided by some circuit.
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_CircuitLowerBoundInfinitelyOftenStatement import Definitions.Def_CircuitLowerBound_Closed import Mathlib.Tactic import Definitions.Def_CircuitLowerBound_Inf set_option autoImplicit false section section open CircuitLowerBound.Inf
Formal statement
theorem ENP.allDecided : ENP.AllDecided := by sorry
Source