首页> 外文会议>Conference on Computability in Europe(CiE 2005); 20050608-12; Amsterdam(NL) >Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism
【24h】

Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism

机译:实际算术层次结构的可计算性和连续性以及2类不确定性的力量

获取原文
获取原文并翻译 | 示例

摘要

The sometimes so-called Main Theorem of Recursive Analysis implies that any computable real function is necessarily continuous. We consider three relaxations of this common notion of real computabil-ity for the purpose of treating also discontinuous functions f : R → R: 1. non-deterministic computation; 2. relativized computation, specifically given access to oracles like 0′ or 0″; 3. encoding input x ∈ R and/or output y = f(x) in weaker ways according to the Real Arithmetic Hierarchy. It turns out that, among these approaches, only the first one provides the required power.
机译:有时称为递归分析的主定理意味着任何可计算的实函数都必须是连续的。为了处理不连续函数f:R→R:1.我们考虑了对实际可计算性这一通用概念的三种松弛。 2.相对化的计算,特别是允许访问像0'或0''之类的oracle; 3.根据实际算术层次结构以较弱的方式对输入x∈R和/或输出y = f(x)进行编码。事实证明,在这些方法中,只有第一种可以提供所需的功率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号