Eliminating Inequalities in Register Machines with Counters


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

It is proved that in programs of register machines with counters, only the equal-to/not-equal-to relations between registers and counters are essential without loss of computational capabilities.

作者简介

I. Savitskii

Faculty of Computational Mathematics and Cybernetics

编辑信件的主要联系方式.
Email: savvvig@gmail.com
俄罗斯联邦, Moscow, 119991

补充文件

附件文件
动作
1. JATS XML

版权所有 © Allerton Press, Inc., 2019