Syntax and semantics of universal programming languages

DOI10.1080/00207167708803129MaRDI QIDQ4130955zbMATH OpenOpenAlexFDO

Authors Richard Hamlet

Publication date 1977

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207167708803129

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• A note on “axioms” for computational complexity and computation of finite functions
• A transportable extendable compiler
• An Algorithm for Structuring Flowgraphs
• Computational complexity of formal translations
• Gödel numberings of partial recursive functions
• Hilbert's Tenth Problem is Unsolvable
• scientific article; zbMATH DE number 3478363 (Why is no real title available?)
• scientific article; zbMATH DE number 3566148 (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?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On the size of machines
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

This page was built for publication: Syntax and semantics of universal programming languages

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