The independence of control structures in abstract programming systems

DOI10.1016/0022-0000(81)90024-6zbMATH Open0467.68009OpenAlexW2022959407MaRDI QIDQ1155949FDOQ1155949

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

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

Cited In (15)

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

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)