Article
Licensed
Unlicensed
Requires Authentication
Simulation of circuits of functional elements by the universal Turing machine
-
A. V. Chashkin
Published/Copyright:
July 1, 2004
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) log2L(S)), where L(S) is the complexity of the circuit S. We demonstrate that this estimate is sharp.
Published Online: 2004-07-01
Published in Print: 2004-07-01
Copyright 2004, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- On the number of closure-type mappings
- Spectral properties of a linear congruent generator in special cases
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Simulation of circuits of functional elements by the universal Turing machine
- Implementation of Markov chains over Galois fields
- On solving automaton equations
- Boundaries of random triangulation of a disk
- On the accuracy of approximation in the Poisson limit theorem
Articles in the same Issue
- On the number of closure-type mappings
- Spectral properties of a linear congruent generator in special cases
- On the key space of the McEliece cryptosystem based on binary Reed–Muller codes
- On the complexity of polarised polynomials of multi-valued logic functions in one variable
- Simulation of circuits of functional elements by the universal Turing machine
- Implementation of Markov chains over Galois fields
- On solving automaton equations
- Boundaries of random triangulation of a disk
- On the accuracy of approximation in the Poisson limit theorem
