Explicit native printer time bound from addressed workspace
ProvedCatalyticTreeEval.Contracts.FinitePrinter.printsIn_of_printsLet M be a fixed native binary machine with s control states. If M prints a finite string y on input x, has empty catalyst and visits only the first b addressed work cells, then the same machine prints y within
transitions and the same workspace. For the mission printing predicate, b is the ceiling of its real workspace allowance. The statement charges the input-head and control information explicitly and allows arbitrarily long unreadable output histories. It supports the timed native access constructions needed by the main simulation.
Preamble
import Definitions.Def_CatalyticTreeEval_FinitePrinter
Formal statement
namespace CatalyticTreeEval.Contracts.FinitePrinter
theorem printsIn_of_prints (M : CatalyticTreeEval.Main.Machine) (input output : List Bool) (space : ℝ)
(prints : CatalyticTreeEval.Main.Prints M input output space) :
CatalyticTreeEval.Main.PrintsIn M input output space
(CatalyticTreeEval.Contracts.FinitePrinter.configurationBound M input.length ⌈space⌉₊ : ℝ) := by
sorry
end CatalyticTreeEval.Contracts.FinitePrinterSource
Infrastructure for Henzinger, Pyne and Ragavan, Catalytic Tree Evaluation from Matching Vectors, https://arxiv.org/html/2602.14320v3, uniform printing and native access construction.