跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2603.18955 · v4

Foundational Analysis Of The Solvability Complexity Index

首次提交 2026-03-19 22:24
版本更新 2026-11-12 22:05
雷达观测 2026-11-13 14:15
arXiv ↗PDF ↗

摘要

The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map ΞΞ from finite samples of an evaluation interface Λ⊆CΩΛ\subseteq\mathbb C^Ω by finite-height towers of pointwise limits. We first give a foundational analysis of what this extensional framework does and does not determine. In second place, we give a concrete non-trivial bridge result from a comparable SCI object to the well known limit rank of Weihrauch theory.

作者备注:Important: [arXiv:2603.18955v2]: additional discussions about evaluation-induced topologies, Kihara-style piecewise-continuity reducibilities, and feasible real RAM models and their connection to the SCI [arXiv:2603.18955v3]: Short+focused version on main results; this version: densified revised version with additional examples, algebraic properties of general algorithms

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-12 22:05 · 最新观测版本

Foundational Analysis Of The Solvability Complexity Index

The Solvability Complexity Index (SCI) provides an extensional limit-height formalism for recovering a target map ΞΞ from finite samples of an evaluation interface Λ⊆CΩΛ\subseteq\mathbb C^Ω by finite-height towers of pointwise limits. We first give a foundational analysis of what this extensional framework does and does not determine. In second place, we give a concrete non-trivial bridge result from a comparable SCI object to the well known limit rank of Weihrauch theory.

查看此版本解读 →查看此版本原文 ↗