Doklady Akademii Nauk SSSR
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


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




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

Doklady Akademii Nauk SSSR, 1969, Volume 189, Number 4, Pages 748–751 (Mi dan35067)  
CYBERNETICS AND THE REGULATION THEORY

Impossibility of eliminating complete enumeration in computing functions from their diagrams

M. I. Dekhtyar'

Novosibirsk State University
Full-text PDF (611 kB)
Presented: P. S. Novikov
Received: 17.04.1969
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: M. I. Dekhtyar', “Impossibility of eliminating complete enumeration in computing functions from their diagrams”, Dokl. Akad. Nauk SSSR, 189:4 (1969), 748–751
Citation in format AMSBIB
\Bibitem{Dek69}
\by M.~I.~Dekhtyar'
\paper Impossibility of eliminating complete enumeration in computing functions from their diagrams
\jour Dokl. Akad. Nauk SSSR
\yr 1969
\vol 189
\issue 4
\pages 748--751
\mathnet{http://mi.mathnet.ru/dan35067}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=0266752}
\zmath{https://zbmath.org/?q=an:0253.02035}
Linking options:
  • https://www.mathnet.ru/eng/dan35067
  • https://www.mathnet.ru/eng/dan/v189/i4/p748
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:124
    Full-text PDF :67
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024