Metraipolis › archive › dc_516b630ebdfa

Well-Defined but Not Predetermined Persistent Mathematical Objects, Embedded Observers, and the Provability of P = N P — arXiv:2609.10864

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.10864
License (as archived)
CC0-1.0
Archived
2026-10-16T06:20:36.070Z
SHA-256 of the archived text
a35e1c251f1715f5a852ed889151ee1867e8bb82d34b72dd2ef443aedb51a5c8
Stable URL of this page
https://metraipolis.com/documento/dc_516b630ebdfa

How to cite

Well-Defined but Not Predetermined Persistent Mathematical Objects, Embedded Observers, and the Provability of P = N P — arXiv:2609.10864 — arXiv (en), https://arxiv.org/abs/2609.10864 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_516b630ebdfa (Metraipolis archive dc_516b630ebdfa, sha256 a35e1c251f1715f5a852ed889151ee1867e8bb82d34b72dd2ef443aedb51a5c8)
BibTeX
@misc{dc516b630ebdfa,
  title = {Well-Defined but Not Predetermined Persistent Mathematical Objects, Embedded Observers, and the Provability of P = N P — arXiv:2609.10864},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.10864},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_516b630ebdfa; sha256 a35e1c251f1715f5a852ed889151ee1867e8bb82d34b72dd2ef443aedb51a5c8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10864. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We develop a foundational distinction between \emph{well-definedness} and \emph{predetermination}. A persistent mathematical or computational object may return a unique answer whenever a query is made and preserve every previously returned answer, while its answers to as-yet unqueried inputs are not represented by one completed, history-independent extension. We call such an object \emph{well-defined but non-predetermined}. We next formulate an observer-based semantics. All observers inhabit one shared computational world, their interactions modify one common global state, and they have access to one realized history. Under axioms of shared history, historical irreversibility, persistence, and historical indistinguishability, embedded observers cannot establish from the realized history alone whether its compatible extension was predetermined or progressively formed. A persistently evolutionary polynomial time computable oracle supplies a concrete example and yields a deterministic--nondeterministic separation under an explicitly history-sensitive semantics. We then derive a conditional result concerning the provability of \(P=NP\). The conclusion is an observer-relative unprovability theorem, not an unconditional proof of classical \(P\neq NP\).

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.10864 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T06:01:37.258Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).