Restricted-Event Observability in the Finite Experand Witness

Finite Experand Dynamics (doi:10.5281/zenodo.23560673) constructs a 24-state witness with five event generators and proves, in Proposition 9, that continuation equivalence under the full event alphabet yields exact deterministic minima of 1, 3, 6, 12, and 24 states as outputs are retained. This note holds the witness and every output fixed and changes one thing: the adverse event a is removed from the set of admissible probes. Under the remaining four events, the exact quotient has 16 states instead of 24. For each of the eight binary backgrounds, the never-adverse state (0,k,v,p) and the recovered state (2,k,v,p) produce identical observations under every finite or adaptive sequence of admissible events, while the single word a separates them at once. Consequently, the pre-probe proposition “this history is recovered” receives the verdict HOLD, and no admissible probe can move it; the only probe that decides it is the one that introduces the unresolved condition on the never-adverse branch. The result is exact, machine-checked by two independent algorithms, and concerns the finite witness under a declared probe restriction. It makes no claim about phenomenal necessity, human harm, or the general impossibility of non-invasive assessment.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-10-26
DOI
https://doi.org/10.5281/zenodo.23668613
Primary Topic
Petri Nets in System Modeling
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Restricted-Event Observability in the Finite Experand Witness

Abraham Chachamovits
Zenodo (CERN European Organization for Nuclear Research)
Petri Nets in System Modeling
preprint

Restricted-Event Observability in the Finite Experand Witness

Abraham Chachamovits
preprint en

Abstract

Finite Experand Dynamics (doi:10.5281/zenodo.23560673) constructs a 24-state witness with five event generators and proves, in Proposition 9, that continuation equivalence under the full event alphabet yields exact deterministic minima of 1, 3, 6, 12, and 24 states as outputs are retained. This note holds the witness and every output fixed and changes one thing: the adverse event a is removed from the set of admissible probes. Under the remaining four events, the exact quotient has 16 states instead of 24. For each of the eight binary backgrounds, the never-adverse state (0,k,v,p) and the recovered state (2,k,v,p) produce identical observations under every finite or adaptive sequence of admissible events, while the single word a separates them at once. Consequently, the pre-probe proposition “this history is recovered” receives the verdict HOLD, and no admissible probe can move it; the only probe that decides it is the one that introduces the unresolved condition on the never-adverse branch. The result is exact, machine-checked by two independent algorithms, and concerns the finite witness under a declared probe restriction. It makes no claim about phenomenal necessity, human harm, or the general impossibility of non-invasive assessment.

Zenodo (CERN European Organization for Nuclear Research)
Petri Nets in System Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon