Algorithmic approximations

DOI10.1016/S0022-0000(71)80008-9MaRDI QIDQ2553150zbMATH OpenOpenAlexFDO

Authors Erwin Engeler

Publication date 1971

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(71)80008-9

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Algorithmic properties of structures
• scientific article; zbMATH DE number 3448070 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• scientific article; zbMATH DE number 3351179 (Why is no real title available?)
• scientific article; zbMATH DE number 3362975 (Why is no real title available?)
• Zur Theorie Algorithmisch Abgeschlossener Modellklassen

Cited in

(4)

• Computation by `While' programs on topological partial algebras
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• scientific article; zbMATH DE number 3448088 (Why is no real title available?)
• Syntactical definitions of program and flow diagram

This page was built for publication: Algorithmic approximations

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