Russian Journal of Cybernetics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Russian Journal of Cybernetics:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Russian Journal of Cybernetics, 2022, Volume 3, Issue 3, Pages 52–62
DOI: https://doi.org/10.51790/2712-9942-2022-3-3-6
(Mi uk43)
 

This article is cited in 1 scientific paper (total in 1 paper)

Bi-infinite calculating automaton

G. E. Deev, S. V. Ermakov

Obninsk Institute for Nuclear Power Engineering, National Research Nuclear University MEPhI, Obninsk, Russian Federation
Full-text PDF (179 kB) Citations (1)
References:
Abstract: Using the concept of extroversion, we designed and studied an abstract automaton that performs multiplication by $3_{(4)}$ in the quadratic number system; besides, it computes an infinite number of related operations. The multiplier by $3_{(4)}$ is used as an example for simplicity. The device is infinite, so the research is mostly theoretical. Nevertheless, it also has some practical value because it reveals the capabilities of real-life computational processes. In particular, it helps find the fastest possible calculations. The device design is unusual. It is a T-shaped cross of two infinities: the infinity of the states (“horizontal”) and the infinity of the input alphabet (“vertical”). That is why the name: bi-infinity automation. Similar bi-infinite devices are generated by many other critical computing devices. Therefore, the transition to bi-infinity helps better understand the essence of computational processes. B-technology can implement some finite slices of each bi-infinite device.
Keywords: numberid, extroversion by states, extroversion by input alphabet, automaton kernel, main computable function, associated functions, the root part of letter, prefix, alphabetic sections.
Funding agency Grant number
Russian Foundation for Basic Research 20-07-00862
This work is as supported by the Russian Fund for Basic Research grant 20-07-00862.
Document Type: Article
Language: Russian
Citation: G. E. Deev, S. V. Ermakov, “Bi-infinite calculating automaton”, Russian Journal of Cybernetics, 3:3 (2022), 52–62
Citation in format AMSBIB
\Bibitem{DeeErm22}
\by G.~E.~Deev, S.~V.~Ermakov
\paper Bi-infinite calculating automaton
\jour Russian Journal of Cybernetics
\yr 2022
\vol 3
\issue 3
\pages 52--62
\mathnet{http://mi.mathnet.ru/uk43}
\crossref{https://doi.org/10.51790/2712-9942-2022-3-3-6}
Linking options:
  • https://www.mathnet.ru/eng/uk43
  • https://www.mathnet.ru/eng/uk/v3/i3/p52
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Russian Journal of Cybernetics
    Statistics & downloads:
    Abstract page:34
    Full-text PDF :5
    References:5
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024