数学信息学:算法
Mathematical Informatics: Algorithms
AI总结:
本文研究问题是在计算理论中发展一种内涵方法;核心方法是将程序和计算作为主要研究对象,并通过单调作用和动态系统来描述计算模型和程序;主要贡献是引入了一个形式化的算法概念,将控制和数据分离,从而精确定义了程序实现算法的条件。
摘要:
本文继续发展一种内涵方法来研究可计算性,该方法最初在之前的研究所提出,其中程序和计算,而不是函数,是主要研究对象。在这种设定中,计算模型被描述为对配置空间的单调作用,而程序则被描述为受此作用约束的动力系统。在此框架内,我们引入了一个形式化的算法概念,即有限有向图,其边由抽象数据结构上的部分映射标记。此定义将控制与数据分离,将前者表示为图,后者表示为操作的代数。我们然后定义在给定计算模型中,程序如何实现此类算法,通过要求计算步骤与标记转换之间的对应关系,从而保持对数据表示的诱导变换。这产生了一个精确的实现概念,并将算法作为计算行为的抽象部分规范。
英文摘要:
This work continues the development of an intensional approach to computability initiated in previous work, in which programs and computations, rather than functions, constitute the primary objects of study. In this setting, models of computation are described as monoid actions on a configuration space, and programs as dynamical systems constrained by this action. Within this framework, we introduce a formal notion of algorithm as a finite directed graph whose edges are labelled by partial maps over an abstract data structure. This definition separates control from data, representing the former as a graph and the latter as an algebra of operations. We then define what it means for a program, in a given model of computation, to implement such an algorithm, by requiring a correspondence between computational steps and labelled transitions that preserves the induced transformations on representations of data. This yields a precise notion of implementation and situates algorithms as abstract partial specifications of computational behaviour.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。