scientific article; zbMATH DE number 3568660
From MaRDI portal
Publication:4141219
zbMath0365.02020MaRDI QIDQ4141219
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Decidability of theories and sets of sentences (03B25) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Algorithms in computer science (68W99) Computability and recursion theory (03Dxx)
Related Items
On computing serial dependency relations, On the computability of circumscription, Analysis of the Turkel-Zwas scheme for the two-dimensional shallow water equations in spherical coordinates, Complexity of probabilistic versus deterministic automata, Foundations of declarative testing in arbitrary logic programming, A simple bijection between σ andn⌣{0}, Primitive transcendental functions and symbolic computation, Symmetric space-bounded computation, A hypercomputational alien, The influence of domain interpretations on computational models
