Algorithmic approximations

DOI10.1016/S0022-0000(71)80008-9zbMath0238.68016OpenAlexW2913030648MaRDI QIDQ2553150

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)

Related Items (4)

Syntactical definitions of program and flow diagram ⋮ Unnamed Item ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ Computation by `While' programs on topological partial algebras

Cites Work

• Algorithmic properties of structures
• Zur Theorie Algorithmisch Abgeschlossener Modellklassen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic approximations