Computability of integer functions by means of collectives of two
automata

Ushakova Valentina Vladimirovna

Computability of integer functions by means of collectives of two automata

Ushakova V. V.

Ushakova Valentina Vladimirovna

graduate student, Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Chair of Mathematical Theory of Intellectual Systems

Published: 2023, vol. 27, issue 3, pp. 137–159

Download full text (In Russian)

Abstract

In this work the computability of one-place partial functions of countable-valued logic by collectives of automata is explored. The class of functions computable by two-automata collectives is found. These are periodic functions and the simplest linear functions, which, starting from some value of the argument x behave like \(f(x) = x + C\) function. It is shown that the class of one-place partial functions of countable-valued logic computable by three-automata collectives is wider.

Keywords: computability, automaton, collectives of automata, periodic functions.

BibTeX

@article{IS-Ushakova2023,
  author  = {Ushakova, Valentina Vladimirovna},
  title   = {{Computability of integer functions by means of collectives of two automata}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2023},
  volume  = {27},
  number  = {3},
  pages   = {137--159},
}

AMSBIB

\Bibitem{IS-Ushakova2023}
\by V.\,V.~Ushakova
\paper Computability of integer functions by means of collectives of two automata
\jour Intelligent Systems. Theory and Applications
\yr 2023
\vol 27
\issue 3
\pages 137--159
\lang In Russian

Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue