Translatability of schemas over restricted interpretations

DOI10.1016/S0022-0000(74)80030-9zbMath0282.68004OpenAlexW1996034913MaRDI QIDQ1844072

A. J. 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

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

Related Items (2)

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

Cites Work

• Program schemes, recursion schemes, and formal languages
• Translating recursion equations into flow charts
• Program Schemes with Pushdown Stores
• Abstract First Order Computability. I
• Computability of Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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