The independence of control structures in abstract programming systems
type: Item
instance of: scholarly article
title: The independence of control structures in abstract programming systems
zbMATH Open document ID: 0467.68009
DOI: 10.1016/0022-0000(81)90024-6
author: Gregory A. Riccardi
published in: Journal of Computer and System Sciences
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68N01
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 3733224
zbMATH Keywords: partial recursive functions
MaRDI profile type: Publication
full work available at URL: 0022-0000(81)90024-6
OpenAlex ID: W2022959407
cites work: Q3902481
cites work: Q4138135
cites work: Q4124253
cites work: Can programming be liberated from the von Neumann style?
cites work: A Machine-Independent Theory of the Complexity of Recursive Functions
cites work: On the size of machines
cites work: Flow diagrams, turing machines and languages with only two formation rules
cites work: Q5183082
cites work: Periodicity in generations of automata
cites work: Comparison of identification criteria for machine inductive inference
cites work: Subrecursive Programming Languages, Part I
cites work: Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
cites work: On folk theorems
cites work: On Simple Goedel Numberings and Translations
cites work: Pascal. User manual and report. 2nd ed
cites work: On notation for ordinal numbers
cites work: Q5812175
cites work: Q3679149
cites work: Q4057549
cites work: Q4055144
cites work: Space and Time Hierarchies for Classes of Control Structures and Data Structures
cites work: On formalised computer programs
cites work: Simple Gödel Numberings, Isomorphisms, and Programming Properties
cites work: Q4153600
cites work: Q4124327
cites work: Program size in restricted programming languages
cites work: Godel Numberings Versus Friedberg Numberings
cites work: Q4127343
cites work: The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions
cites work: Gödel numberings of partial recursive functions
cites work: Q5573961
cites work: On Suborderings of Degrees of Recursive Unsolvability
cites work: Optimal enumerations and optimal gödel numberings
cites work: Theory of Formal Systems. (AM-47)
cites work: The infinite injury priority method
cites work: Q3969890
cites work: Prolegomena to a theory of mechanized formal reasoning
description: scientific article; zbMATH DE number 3733224