scientific article; zbMATH DE number 3090158
From MaRDI portal
Publication:5829025
zbMath0056.24901MaRDI QIDQ5829025
Publication date: 1954
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (27)
The effects of effects on constructivism ⋮ A universal machine without change of state ⋮ Overlapping algorithms ⋮ On fixed-point theorems in synthetic computability ⋮ Intuitionism and effective descriptive set theory ⋮ Unnamed Item ⋮ On the information carried by programs about the objects they compute ⋮ On the eliminability of ideal linguistic entities ⋮ The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations ⋮ Notes on computable analysis ⋮ A Banach-Mazur computable but not Markov computable function on the computable real numbers ⋮ On systems of word equations over three unknowns with at most six occurrences of one of the unknowns ⋮ Distributive lattices of subspaces and the equality problem for algebras with a single relation ⋮ A survey of predicate realizability logic ⋮ Constructivization of the concepts of \(\varepsilon\) entropy and \(\varepsilon\) capacity ⋮ Decidability of elementary theories of certain finitely defined algebras ⋮ Primitive constructive functions ⋮ Beziehungen zwischen gewissen Klassen effektiv topologischer Räume ⋮ Nonalgorithmic discrete procedures ⋮ PANON-1B: A programming language for symbol manipulation ⋮ Computing congruent closures on terms ⋮ 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 ⋮ Finitely presented semigroups with nontrivial identities ⋮ Markov's constructive analysis; a participant's view ⋮ Unsolvability of the universal theory of finite groups ⋮ The non-parametrizability of the word equation \(xyz=zvx\): a short proof
This page was built for publication:
