arXiv (All)
open access
Analog and Symbolic Computation through the Koopman Framework
cellular-automata-and-lattice-gaseslogic-in-computer-sciencemathematical-physicssymbolic-computation
We develop a Koopman operator framework for studying the {computational properties} of dynamical systems. Specifically, we show that the resolvent of the Koopman operator provides a natural abstraction of halting, yielding a ``Koopman halting problem that is recursively enumerable in general. For sy
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Beyond the Ontological Difference: Heidegger, Binswanger, and the Future of Existential Analysis#733059
- Oracle Synthesis Based on X-Map Decision Diagrams#1034831
- Formal Languages, Automata and Numeration Systems 1#1190152
- A Dichotomy for Boolean Complex Holant Problems with Conjugate-Closed Signature Sets#1070625
- The Swapping Constraint#766469
Record · ID 1354098
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive