Translatability of schemas over restricted interpretations

DOI10.1016/S0022-0000(74)80030-9MaRDI QIDQ1844072zbMATH OpenOpenAlexFDO

Authors Assaf Kfoury

Publication date 1974

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0022-0000(74)80030-9

Mathematics Subject Classification ID

Computability and recursion theory (03D99) General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cites work

• Abstract First Order Computability. I
• Computability of Recursive Functions
• scientific article; zbMATH DE number 3555422 (Why is no real title available?)
• scientific article; zbMATH DE number 3594625 (Why is no real title available?)
• scientific article; zbMATH DE number 3622921 (Why is no real title available?)
• scientific article; zbMATH DE number 3441605 (Why is no real title available?)
• scientific article; zbMATH DE number 3349780 (Why is no real title available?)
• scientific article; zbMATH DE number 3356759 (Why is no real title available?)
• scientific article; zbMATH DE number 3362972 (Why is no real title available?)
• scientific article; zbMATH DE number 3103214 (Why is no real title available?)
• Program Schemes with Pushdown Stores
• Program schemes, recursion schemes, and formal languages
• Translating recursion equations into flow charts

Cited in

(2)

• Counter machines
• Necessary and sufficient conditions for the universality of programming formalisms

This page was built for publication: Translatability of schemas over restricted interpretations

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