scientific article; zbMATH DE number 3146798
From MaRDI portal
Publication:3262783
Cited in
(23)- Time complexity of multidimensional Turing machines
- Some effectively infinite classes of enumerations
- Markov's constructive analysis; a participant's view
- Minimal model of a cell connecting amoebic motion and adaptive transport networks
- Nonalgorithmic discrete procedures
- Optimal measures and Markov transition kernels
- Problems of constructing intelligent systems. Intelligent modeling
- Efficient algorithms for the temporal precedence problem
- Group Input Machine
- Semantics-to-Syntax Analyses of Algorithms
- Is universal computation a myth?
- The complexity of error-correcting codes
- Proof verification and proof discovery for relativity
- Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
- 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
- Cellular automata modelling of slime mould actin network signalling
- Approximation of functions from Korobov spaces by shallow neural networks
- On cardinalities of Rogers semilattices for families in the Ershov hierarchy
- Computability of real functions with oracle pointer machines implies real-time simulation of chemical reaction networks
- On arithmetical numberings in reverse mathematics
- In some curved spaces, one can solve NP-hard problems in polynomial time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3262783)
