arXiv (All)
open access
Complexity of deep computations via topology of function spaces
We use topological methods to study complexity of deep computations and limit computations. We use topology of function spaces, specifically, the classification of Rosenthal compacta, to identify new complexity classes. We use the language of model theory, specifically, the concept of \emph{independ
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
- The untangling number as a measurement of entanglement complexity in 3-periodic networks#1232600
- Computational complexity perspective on graphical calculi for quantum computation#296051
- Exact Realization of Deep ReLU Computation in a Microscopic Statistical-Mechanical System#1048360
- Von Neumann Networks#1216299
- Observability of Turing Machines: a refinement of the theory of computation#766885
Record · ID 1247320
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