|
Intelligent systems. Theory and applications, 2021, Volume 25, Issue 3, Pages 189–190
(Mi ista320)
|
|
|
|
Part 3. Mathematical models
On the correspondence between the complexity of the sfe and the number of steps of the Turing machine
M. V. Nosov Lomonosov Moscow State University
Abstract:
The work schematically proves an intuitive fact on the correspondence of the polynomial complexity of the SFE in the basis of the Schaeffer prime polynomial number of steps of the Turing machine. Numerical estimates are given.
Keywords:
circuit complexity, Schaeffer's stroke, Turing machine.
Citation:
M. V. Nosov, “On the correspondence between the complexity of the sfe and the number of steps of the Turing machine”, Intelligent systems. Theory and applications, 25:3 (2021), 189–190
Linking options:
https://www.mathnet.ru/eng/ista320 https://www.mathnet.ru/eng/ista/v25/i3/p189
|
Statistics & downloads: |
Abstract page: | 50 | Full-text PDF : | 21 |
|