arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.4642cs.PL
收藏

一种巨数运算的Prolog规范

A Prolog Specification of Giant Number Arithmetic

Paul Tarau

摘要:

本文中描述的基于树的表示,遗传二进制数,递归地应用游程长度压缩机制,使计算限制其操作数的结构复杂性,而不是由其位大小。虽然在其最坏情况行为的传统对应物的恒定因子内,但我们的算术运算为有趣的数值计算打开了大门,这是传统数字表示法所不可能的。我们提供了一个完整的规范,我们的算法的形式,一个纯粹的声明性Prolog程序。

英文摘要:

The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the structural complexity of their operands rather than by their bitsizes. While within constant factors from their traditional counterparts for their worst case behavior, our arithmetic operations open the doors for interesting numerical computations, impossible with traditional number representations. We provide a complete specification of our algorithms in the form of a purely declarative Prolog program.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑