Semantic Uniqueness and Non-Uniqueness of Machine Realizations
This note distinguishes equivalence of computational realizations from equivalence of their homotopy n-truncated operational semantics. It treats finite specifications, trace reification, semantic cofinality, and recursive self-improvement, arguing that a unique semantic class can admit inequivalent machine realizations.
Anonymous