The independence of control structures in abstract programming systems

DOI10.1016/0022-0000(81)90024-6MaRDI QIDQ1155949zbMATH OpenOpenAlexFDO

Authors Gregory A. Riccardi

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

zbMATH Keywords

partial recursive functions

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Cites work

• scientific article; zbMATH DE number 3900718 (Why is no real title available?)
• scientific article; zbMATH DE number 3711369 (Why is no real title available?)
• scientific article; zbMATH DE number 3793435 (Why is no real title available?)
• scientific article; zbMATH DE number 3471564 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3550116 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3553723 (Why is no real title available?)
• scientific article; zbMATH DE number 3566169 (Why is no real title available?)
• scientific article; zbMATH DE number 3586480 (Why is no real title available?)
• scientific article; zbMATH DE number 3431764 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Can programming be liberated from the von Neumann style?
• Comparison of identification criteria for machine inductive inference
• Flow diagrams, turing machines and languages with only two formation rules
• Godel Numberings Versus Friedberg Numberings
• Gödel numberings of partial recursive functions
• On Simple Goedel Numberings and Translations
• On Suborderings of Degrees of Recursive Unsolvability
• On folk theorems
• On formalised computer programs
• On notation for ordinal numbers
• On the size of machines
• Optimal enumerations and optimal gödel numberings
• Pascal. User manual and report. 2nd ed
• Periodicity in generations of automata
• Program size in restricted programming languages
• Prolegomena to a theory of mechanized formal reasoning
• Simple Gödel Numberings, Isomorphisms, and Programming Properties
• Space and Time Hierarchies for Classes of Control Structures and Data Structures
• Subrecursive Programming Languages, Part I
• The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
• The independence of control structures in abstract programming systems
• The infinite injury priority method
• Theory of Formal Systems. (AM-47)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(15)

• Characterizing programming systems allowing program self-reference
• Program size restrictions in computational learning
• scientific article; zbMATH DE number 605140 (Why is no real title available?)
• Costs of general purpose learning
• Computable one-to-one enumerations of effective domains
• Hypothesis spaces for learning
• The independence of control structures in abstract programming systems
• Composition is almost (but not quite) as good as \(s-1-1\)
• Machine induction without revolutionary paradigm shifts
• Spatial/kinematic domain and lattice computers
• Effectivity questions for Kleene's recursion theorem
• Effectivity questions for Kleene's recursion theorem
• Maximal machine learnable classes
• Infinitary self-reference in learning theory
• Control structures in hypothesis spaces: The influence on learning

This page was built for publication: The independence of control structures in abstract programming systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1155949)