首页> 外文期刊>Fundamenta Informaticae >Recursive Analysis Characterized as a Class of Real Recursive Functions
【24h】

Recursive Analysis Characterized as a Class of Real Recursive Functions

机译:表征为一类实数递归函数的递归分析

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

摘要

Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive analysis. In a different and orthogonal work, we proposed a minimalization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixing the two approaches we prove that computable functions over the real numbers in the sense of recursive analysis can be characterized as the smallest class of functions that contains some basic functions, and closed by composition, linear integration, minimalization and limit schema.
机译:最近,使用极限模式,在递归分析的意义上,我们提出了基本函数在实数上的模拟和机器无关的代数表征。在不同的正交工作中,我们提出了一种最小化方案,该方案允许提供一类实际的递归函数,该函数与可计算函数在整数上的扩展相对应。混合这两种方法,我们证明了在递归分析意义上的可计算函数在实数上可以被描述为包含某些基本函数的最小类函数,并通过组合,线性积分,最小化和极限方案来封闭。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号