Journal ArticleDOI
Loop-programs and polynomially computable functions
Amir Amihud,Yaacov Choueka +1 more
Reads0
Chats0
TLDR
It turns out that loop programs can be characterized as the class of all recursive functions that are computable with a polynomial number of steps by modified programs.Abstract:
By slightly modifying the original definition of loop-programs by Meyer and Ritchie, a modified hierarchy of loop(n) programs , is obtained, with the following characteristics. Let be the class of functions defined by programs in , be the Grzegorzcyk hierarchy. Then , where in particular has a natural counterpart in loop programs. It also turns out that can be characterized as the class of all recursive functions that are computable with a polynomial number of steps by modified programs.read more
Citations
More filters
Journal ArticleDOI
Super-exponentials nonprimitive recursive, but rudimentary
TL;DR: It is proved that every super-exponential function of Ackermann type (i.e., nonprimitive recursive) in the sense of Porto and Matos (1980) in Smullyan rudimentary is proved.
Journal ArticleDOI
Simple programming languages and restricted classes of turing machines
Oscar H. Ibarra,Louis E. Rosier +1 more
TL;DR: The computational power of simple programming languages is investigated and characterizations (or partial characterizations) of the functions computable by such programs in terms of some space and/or time complexity classes of Turing machines are provided.
Journal ArticleDOI
Monadic logic programs and functional complexity
TL;DR: Problems related to the complexity and to the decidability of several languages weaker than Prolog are studied, that is, programs containing only monadic functions and monadic predicates are considered in detail.
Book ChapterDOI
Yaacov Choueka: A Profile
Nachum Dershowitz,Ephraim Nissan +1 more
TL;DR: Yaacov Choueka was born in 1936 in Cairo, Egypt to a family of renowned rabbis who had emigrated from Aleppo to Cairo in the early years of the twentieth century.
Journal ArticleDOI
A syntactical definition of the problem
Amihood Amir,Yaacov Choceka +1 more
TL;DR: A syntactically simple language is proposed that is exactly those which are polynomially computable by Turing Machines, thus enabling to define the problem as an equivalence problem of two languages.
References
More filters
Proceedings ArticleDOI
The complexity of loop programs
TL;DR: A class of programs, called “Loop programs,” which consists only of assignment statements and iteration (loop) statements, the latter resembling the DO statement of FORTRAN, and special cases of the FOR and THROUGH statements of ALGOL and MAD.