Decidable problems for powerful programs
Journal of the ACM (JACM)
Synthesizing enumeration techniques for language learning
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Technical opinion: noncomputability is easy to understand
Communications of the ACM
The Equivalence Problem of Simple Programs
Journal of the ACM (JACM)
An Overview of the Theory of Computational Complexity
Journal of the ACM (JACM)
Subrecursive Programming Languages, Part I: efficiency and program structure
Journal of the ACM (JACM)
Ordinal Hierarchies and Naming Complexity Classes
Journal of the ACM (JACM)
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
Journal of the ACM (JACM)
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM (JACM)
On the Complexity of Flowchart and Loop Program Schemes and Programming Languages
Journal of the ACM (JACM)
On the Simplification and Equivalence Problems for Straight-Line Programs
Journal of the ACM (JACM)
The denotational semantics of programming languages
Communications of the ACM
On the fundamental limitations of transformational design
ACM Transactions on Design Automation of Electronic Systems (TODAES)
A complete and consistent hoare axiomatics for a simple programming language
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Analysis of simple programs over different sets of primitives
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The undecidability of associativity and commutativity analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
On P Systems with Active Membranes Solving the Integer Factorization Problem in a Polynomial Time
WMP '00 Proceedings of the Workshop on Multiset Processing: Multiset Processing, Mathematical, Computer Science, and Molecular Computing Points of View
Linear programs in a simple reversible language
Theoretical Computer Science
The complexity of the equivalence problem for counter machines, semilinear sets, and simple programs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
APL and the Grzegorczyk hierarchy
APL '79 Proceedings of the international conference on APL: part 1
The complexity of the equivalence problem for straight-line programs
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Predecessor machines and regressing functions
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Program size and economy of descriptions: Preliminary Report
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Classification of computable functions by primitive recursive classes
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
On the size of programs in subrecursive formalisms
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
Decision problems in computational models
Proceedings of ACM conference on Proving assertions about programs
On the computational complexity of imperative programming languages
Theoretical Computer Science - Implicit computational complexity
Proceedings of the 2006 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Theory of computing in computer science education
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Subrecursive programming languages II on program size
Journal of Computer and System Sciences
Augmented loop languages and classes of computable functions
Journal of Computer and System Sciences
Algorithms and theory of computation handbook
Static complexity analysis of higher order programs
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Measuring agent intelligence via hierarchies of environments
AGI'11 Proceedings of the 4th international conference on Artificial general intelligence
Register complexity of LOOP-, WHILE-, and GOTO-Programs
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
A Representation Theorem for Primitive Recursive Algorithms
Fundamenta Informaticae
Andrzej Grzegorczyk's Contribution to Computer Science
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Variable Complexity of Simple Programs
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A note on comparison of subrecursive hierarchies
Information Processing Letters
| Hi-index | 0.03 |
Anyone familiar with the theory of computability will be aware that practical conclusions from the theory must be drawn with caution. If a problem can theoretically be solved by computation, this does not mean that it is practical to do so. Conversely, if a problem is formally undecidable, this does not mean that the subcases of primary interest are impervious to solution by algorithmic methods. In the next section we describe such a class of programs, called “Loop programs.” Each Loop program 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. The bound on the running time of a Loop program is determined essentially by the length of the program and the depth of nesting of its loops.