On simple programs with primitive conditional statements

Q4 Mathematics
Oscar H. Ibarra , Louis E. Rosier
{"title":"On simple programs with primitive conditional statements","authors":"Oscar H. Ibarra ,&nbsp;Louis E. Rosier","doi":"10.1016/S0019-9958(85)80019-X","DOIUrl":null,"url":null,"abstract":"<div><p>This paper is concerned with the expressive power (or computational power) of loop programs over different sets of primitive instructions. In particular, we show that an {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>do x</em> … <em>end</em>, <em>if x</em> = 0 <em>then y</em> ← <em>z</em>}-program which contains no nested loops can be transformed into an equivalent {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>do x</em> … <em>end</em>}-program (also without nested loops) in exponential time and space. This translation was earlier claimed, in the literature, to be obtainable in polynomial time, but then this was subsequently shown to imply that PSPACE = PTIME. Consequently, the question of translatability was left unanswered. Also, we show that the class of functions computable by {<em>x</em> ← 0, <em>x</em> ← <em>y</em>, <em>x</em> ← <em>x</em> + 1, <em>x</em> − 1, <em>do x</em> … <em>end</em>, <em>if x</em> = 0 <em>then x</em> ← <em>c</em>}-programs is exactly the class of Presburger functions.</p></div>","PeriodicalId":38164,"journal":{"name":"信息与控制","volume":"65 1","pages":"Pages 42-62"},"PeriodicalIF":0.0000,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0019-9958(85)80019-X","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"信息与控制","FirstCategoryId":"1093","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S001999588580019X","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

Abstract

This paper is concerned with the expressive power (or computational power) of loop programs over different sets of primitive instructions. In particular, we show that an {x ← 0, xy, xx + 1, do xend, if x = 0 then yz}-program which contains no nested loops can be transformed into an equivalent {x ← 0, xy, xx + 1, do xend}-program (also without nested loops) in exponential time and space. This translation was earlier claimed, in the literature, to be obtainable in polynomial time, but then this was subsequently shown to imply that PSPACE = PTIME. Consequently, the question of translatability was left unanswered. Also, we show that the class of functions computable by {x ← 0, xy, xx + 1, x − 1, do xend, if x = 0 then xc}-programs is exactly the class of Presburger functions.

用原始条件语句的简单程序
本文关注的是循环程序在不同原始指令集上的表达能力(或计算能力)。特别地,我们证明了不包含嵌套循环的{x←0,x←y, x←x + 1, do x…end,如果x = 0,则y←z}程序可以在指数时间和空间中转换为等价的{x←0,x←y, x←x + 1, do x…end}程序(也不包含嵌套循环)。在文献中,这种转换早先声称在多项式时间内可获得,但随后证明这意味着PSPACE = PTIME。因此,可译性问题没有得到答复。同时,我们证明了可由{x←0,x←y, x←x + 1, x−1,do x…end计算的函数类,如果x = 0则x←c}-程序正是Presburger函数类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
信息与控制
信息与控制 Mathematics-Control and Optimization
CiteScore
1.50
自引率
0.00%
发文量
4623
期刊介绍:
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信