On the structural simplicity of machines and languages

DOI10.1007/BF01536402zbMath0858.68019OpenAlexW2077948888MaRDI QIDQ1924785

Yael Moscowitz, Ehud Shapiro

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01536402

zbMATH Keywords

Turing machinescomputational complexity boundaries

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Algebraic translations, correctness and algebraic compiler construction

Cites Work

• On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
• Propositional dynamic logic of regular programs
• Alternation and the computational complexity of logic programs
• Alternation
• Fixpoint logics, relational machines, and computational complexity
• Program Schemes with Pushdown Stores
• The next 700 programming languages
• On Classes of Program Schemata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item