Observable Answers and Executable Queries

From an answer to an executable procedure

An abstract description can contain enough information for an answer without providing a way to obtain it. This report separates sufficient information, available tests and legal execution in a finite exact model. It is an expository synthesis with reproducible examples, not a claim of a new general optimizer or CM-exclusive speedup.

Read the complete report online.

Connection to B-Theory and Tensor Logic

The report complements ProLT, RF-IDENT and Acquirable Predictive Models by asking what acquiring a requested distinction costs and which prerequisite actions are needed. Their different admissibility and dynamics assumptions require separate checks before combining results.

Tensor Logic supplies a tensor-equation motivation; CM/LM makes Boolean frames and pairings explicit. The worked cancellation has an ordinary Boolean baseline with the same optimum. No Tensor Logic runtime, learned-embedding guarantee, physical sensing result or theory of consciousness is established.

Reading formats and reproduction

Seven-page PDF · HTML/MathML reader · LaTeX source · Text transcription · Reproducibility companion package.

The seven-page report is the current reader-facing manuscript. The longer Round 6 draft is historical background, not a separate stronger submission. Internal AI audits and exact tests are distinct from external peer review. Source and code are supplied for inspection and reproducibility. This release grants no additional reuse or open-source license.