Simulation of circuits of functional elements by the universal Turing machine
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378896792 | ||
| 003 | CHVBK | ||
| 005 | 20180305123508.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20040701xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/1569392031905557 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/1569392031905557 | ||
| 100 | 1 | |a Chashkin |D A. V. | |
| 245 | 1 | 0 | |a Simulation of circuits of functional elements by the universal Turing machine |h [Elektronische Daten] |c [A. V. Chashkin] |
| 520 | 3 | |a 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) log2 L(S)), where L(S) is the complexity of the circuit S. We demonstrate that this estimate is sharp. | |
| 540 | |a Copyright 2004, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/3(2004-07-01), 267-272 |x 0924-9265 |q 14:3<267 |1 2004 |2 14 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/1569392031905557 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/1569392031905557 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Chashkin |D A. V. | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 14/3(2004-07-01), 267-272 |x 0924-9265 |q 14:3<267 |1 2004 |2 14 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||