arXiv (All)
open access
From raw Solvability Complexity Index proofs to Weihrauch degrees
The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map $Ξ$ from finite samples of an evaluation interface $Λ$ by finite-height towers of pointwise limits. At first sight this sounds like a typical Type-2 question, so it seems natural to ask
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
- Computational Complexity of the Weisfeiler-Leman Dimension / Moritz Lichter, Simon Raßmann, Pascal Schweitzer#628988
- Deterministic LLM Inference Across GPU Kernels: Power-of-Two INT8 Quantization Scales and the Limits of Tolerance-Based Conformance#819815
- Deterministic LLM Inference Across GPU Kernels: Power-of-Two INT8 Quantization Scales and the Limits of Tolerance-Based Conformance#809819
- The Complexity Kink: A Prompt-Side Structural Complexity Index for Code-Generation Reliability#1014206
- The Complexity Kink: A Prompt-Side Structural Complexity Index for Code-Generation Reliability#978496
Record · ID 1035658
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