Toy: toy Runs
ProvedQueryMachines.Tower.Toy.toyRunsalgorithmsanthropic-eth-16a5ce4complexity-theory
ONE machine, on the input (ℓ, b), with query access to a table f whose entries for the bit strings of length ℓ are at most M0, at t operations per query: it returns the sum of f over all bit strings of length ℓ within 2^ℓ·(t + 2ℓ + 5) operations.
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_Toy_Defs import Definitions.Def_Tower_Toy_Spec import Definitions.Def_Tower_Kernel import Definitions.Def_Tower_TowerRuns import Definitions.Def_StepMachines_Prog_SideBasics import Mathlib.Tactic.Ring import Definitions.Def_Tower_Toy_Meets set_option autoImplicit false section section open QueryMachines QueryMachines.Tower QueryMachines.Tower.Toy open Groundwork Groundwork.Prog
Formal statement
theorem QueryMachines.Tower.Toy.toyRuns : ToyRuns := by sorry
Source