IndisputableMonolith.Complexity.SAT.Runtime
This module supplies abstract runtime parameters for the cellular automaton embedding in SAT complexity analysis. Researchers bounding simulation overheads in Recognition Science would reference these parameters when deriving time bounds for 3-SAT instances. It is a definition module containing no theorems or proofs.
claimThe module introduces abstract runtime parameters for the cellular automaton (CA) embedding, including model objects for runtime, logical depth, and time bounds in CA-to-Turing-machine simulations.
background
The module sits in the Complexity domain and imports Mathlib for underlying structures. It supplies the abstract parameters needed for embedding cellular automata into SAT runtime arguments, with sibling declarations handling concrete models and propositions. The local setting is abstract parameterization of runtime for CA embeddings rather than concrete numerical bounds or proofs.
proof idea
this is a definition module, no proofs
why it matters in Recognition Science
The module provides the parameter foundation that feeds into sibling results such as the CA-to-TM simulation property and the three-SAT runtime proposition. It closes the abstract layer required before concrete bounds or simulation theorems can be stated in the Recognition Science complexity chain.
scope and limits
- Does not assign concrete numerical values to runtime parameters.
- Does not contain simulation correctness proofs.
- Does not address specific 3-SAT instance sizes or reductions.