Publication:5829025
From MaRDI portal
zbMath0056.24901MaRDI QIDQ5829025
Publication date: 1954
03F60: Constructive and recursive analysis
Related Items
Unnamed Item, Overlapping algorithms, The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations, On the eliminability of ideal linguistic entities, Unsolvability of the universal theory of finite groups, A universal machine without change of state, Distributive lattices of subspaces and the equality problem for algebras with a single relation, Constructivization of the concepts of \(\varepsilon\) entropy and \(\varepsilon\) capacity, Computing congruent closures on terms, Markov's constructive analysis; a participant's view, A Banach-Mazur computable but not Markov computable function on the computable real numbers, Decidability of elementary theories of certain finitely defined algebras, Nonalgorithmic discrete procedures, Finitely presented semigroups with nontrivial identities, On systems of word equations over three unknowns with at most six occurrences of one of the unknowns, A survey of predicate realizability logic, Primitive constructive functions, Beziehungen zwischen gewissen Klassen effektiv topologischer Räume, PANON-1B: A programming language for symbol manipulation, A conditional functional three-handling generalized Markov algorithm which interprets a nondeterministic abstract machine, On the algorithmic undecidability of A-completeness for the boundedly determinate functions, The non-parametrizability of the word equation \(xyz=zvx\): a short proof
