scientific article
From MaRDI portal
Publication:3262783
zbMath0090.01101MaRDI QIDQ3262783
Publication date: 1958
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (19)
Efficient algorithms for the temporal precedence problem ⋮ In some curved spaces, one can solve NP-hard problems in polynomial time ⋮ The complexity of error-correcting codes ⋮ Numberings, c.e. oracles, and fixed points ⋮ Hardware Implementation of a Biomimicking Hybrid CA ⋮ On two types of concept lattices in the theory of numberings ⋮ Optimal measures and Markov transition kernels ⋮ Cellular automata modelling of slime mould actin network signalling ⋮ Time complexity of multidimensional Turing machines ⋮ Semantics-to-Syntax Analyses of Algorithms ⋮ Proof verification and proof discovery for relativity ⋮ Some effectively infinite classes of enumerations ⋮ Group Input Machine ⋮ Is Universal Computation a Myth? ⋮ Minimal model of a cell connecting amoebic motion and adaptive transport networks ⋮ Problems of constructing intelligent systems. Intelligent modeling ⋮ Vladimir Andreevich Uspensky (27/11/1930–27/6/2018) ⋮ Nonalgorithmic discrete procedures ⋮ Markov's constructive analysis; a participant's view
This page was built for publication:
