Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A universal Turing machine with $10$ states and $3$ symbols. (Russian)
Authors: Rogojin Iurie
Abstract
Universal turing machine with 10 states and 3 symbols constructed. In this paper method by M.~Minsky of modeling TAG-systems with $P=2$ used. Let $(n,m)$ - class of turing machines with $n$ states and $m$ symbols. From results obtained early and obtained in this paper we conclude what no studyed (is there universal) turing machine?) 54 classes of turing machines.Contents
- Generalized nonlocal splines with one free generating function. Estimations of interpolation accuracy. (English)
- Stability properties of delay systems under a Taylor series representation. (English)
- Derivation of nontrivial subgroups and minimal systems of generators of point crystallographic groups by means of a computer. (Russian)
- Berge-acyclic database schemes. (Romanian)
- Frieze groups of two-sided rosette $P$-symmetries and their geometric applications. (Russian)
- Solution of the problem of completeness with respect to expressibility in a $5$-valued nonchain extension of duality intuitionistic logic. (Russian)
- Numerical analysis of a problem on wave propagation in a viscoelastic rod. (Russian)
- Construction of quasi-affine axiomatics of Lobachevskij geometry. (Russian)
- Monoquasigroups without congruences and automorphisms. (Russian)
- An algorithm for finding the minimax paths in networks. (Russian)
- A universal Turing machine with $10$ states and $3$ symbols. (Russian)
- On the $L_p$-boundedness of the resolvent operator of the Cauchy problem for a higher-order one-dimensional hyperbolic equation. (Russian)
