The independence of control structures in abstract programming systems
From MaRDI portal
Publication:1155949
DOI10.1016/0022-0000(81)90024-6zbMath0467.68009OpenAlexW2022959407MaRDI QIDQ1155949
Publication date: 1981
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(81)90024-6
Related Items (15)
Program size restrictions in computational learning ⋮ Effectivity Questions for Kleene’s Recursion Theorem ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Infinitary self-reference in learning theory ⋮ Spatial/kinematic domain and lattice computers ⋮ Machine induction without revolutionary paradigm shifts ⋮ The independence of control structures in abstract programming systems ⋮ Hypothesis spaces for learning ⋮ Costs of general purpose learning ⋮ Computable one-to-one enumerations of effective domains ⋮ Control structures in hypothesis spaces: The influence on learning ⋮ Characterizing programming systems allowing program self-reference ⋮ Unnamed Item ⋮ Maximal machine learnable classes ⋮ Composition is almost (but not quite) as good as \(s-1-1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- Prolegomena to a theory of mechanized formal reasoning
- The independence of control structures in abstract programming systems
- Pascal. User manual and report. 2nd ed
- On formalised computer programs
- The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Gödel numberings of partial recursive functions
- Theory of Formal Systems. (AM-47)
- On folk theorems
- Periodicity in generations of automata
- Program size in restricted programming languages
- Optimal enumerations and optimal gödel numberings
- The infinite injury priority method
- Space and Time Hierarchies for Classes of Control Structures and Data Structures
- Can programming be liberated from the von Neumann style?
- Simple Gödel Numberings, Isomorphisms, and Programming Properties
- On Simple Goedel Numberings and Translations
- Flow diagrams, turing machines and languages with only two formation rules
- A Machine-Independent Theory of the Complexity of Recursive Functions
- On the size of machines
- Godel Numberings Versus Friedberg Numberings
- Subrecursive Programming Languages, Part I
- On Suborderings of Degrees of Recursive Unsolvability
- On notation for ordinal numbers
This page was built for publication: The independence of control structures in abstract programming systems