Metraipolis › archive › dc_7a8d6d4cf074

Monodromy Computation Model — arXiv:2611.04377

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04377
License (as archived)
CC0-1.0
Archived
2026-11-04T19:07:52.282Z
SHA-256 of the archived text
69f3e23e246595a3d6644b9d65962a51e738c8ac1b69e4972438bb130a02091a
Stable URL of this page
https://metraipolis.com/documento/dc_7a8d6d4cf074

How to cite

Monodromy Computation Model — arXiv:2611.04377 — arXiv (en), https://arxiv.org/abs/2611.04377 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7a8d6d4cf074 (Metraipolis archive dc_7a8d6d4cf074, sha256 69f3e23e246595a3d6644b9d65962a51e738c8ac1b69e4972438bb130a02091a)
BibTeX
@misc{dc7a8d6d4cf074,
  title = {Monodromy Computation Model — arXiv:2611.04377},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04377},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7a8d6d4cf074; sha256 69f3e23e246595a3d6644b9d65962a51e738c8ac1b69e4972438bb130a02091a},
  year = {2026}
}

Archived text

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

A closed path can return to its starting point while analytic continuation reaches another branch. We construct a finite computational calculus in which retained logarithmic branches supply memory, analytic observations select operations, and descent through a covering exposes deeper memory. Three branch coordinates suffice, and every finite observation uses the same cubic power covering. Each program defines a globally real analytic return map whose integer-lattice execution is realized by actual path lifting. Our first theorem simulates every finite-alphabet, finite-control Post--Turing machine, preserving complete configurations, halting, and divergence. Our second theorem identifies the partial numeric functions of the calculus, under fixed primitive-recursive input and output maps, with exactly the partial recursive functions. Deleting descent leaves a Forward language with a syntax-derived finite observation quotient and a primitive-recursive halting predicate. This yields a strict separation within the calculus and identifies access to deeper memory as its decisive additional operation. The constructions and semantic correspondences are formalized in Lean 4 with Mathlib.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2611.04377 — 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-11-04T18:41:07.429Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).