Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2004, Volume 16, Issue 2, Pages 98–103
DOI: https://doi.org/10.4213/dm155 (Mi dm155) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Modeling circuits consisting of functional elements on a universal Turing machine

A. V. Chashkin
Full-text PDF (711 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm155
Abstract: We study the time of simulation of Boolean circuits by three-tape Turing machine which uses one of the tapes to store the control program. We find that for any circuit $S$ there exists a program $P$ such that the simulation time $T(P)$ for the circuit $S$ satisfies the relation $T(P)=O(L(S)\log_2L(S))$, where $L(S)$ is the complexity of the circuit $S$. We demonstrate that this estimate is sharp.
This research was supported by the Russian Foundation for Basic Research, grants 02–01–00985 and 00–15–96103.
Received: 21.04.2003
English version:
Discrete Mathematics and Applications, 2004, Volume 14, Issue 3, Pages 267–272
DOI: https://doi.org/10.1515/1569392031905557
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. V. Chashkin, “Modeling circuits consisting of functional elements on a universal Turing machine”, Diskr. Mat., 16:2 (2004), 98–103; Discrete Math. Appl., 14:3 (2004), 267–272
Citation in format AMSBIB
\Bibitem{Cha04}
\by A.~V.~Chashkin
\paper Modeling circuits consisting of functional elements on a universal Turing machine
\jour Diskr. Mat.
\yr 2004
\vol 16
\issue 2
\pages 98--103
\mathnet{http://mi.mathnet.ru/dm155}
\crossref{https://doi.org/10.4213/dm155}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2084572}
\zmath{https://zbmath.org/?q=an:1121.68048}
\transl
\jour Discrete Math. Appl.
\yr 2004
\vol 14
\issue 3
\pages 267--272
\crossref{https://doi.org/10.1515/1569392031905557}
Linking options:
  • https://www.mathnet.ru/eng/dm155
  • https://doi.org/10.4213/dm155
  • https://www.mathnet.ru/eng/dm/v16/i2/p98
    • 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
    		Дискретная математика
    Statistics & downloads:
    Abstract page:635
    Full-text PDF :330
    References:20
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024