Simulation of circuits of functional elements by the universal Turing machine

DOI10.1515/1569392031905557MaRDI QIDQ4825179zbMATH OpenOpenAlexFDO

Authors A. V. Chashkin

Publication date 27 October 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/1569392031905557

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 2099460
• scientific article; zbMATH DE number 1396672
• scientific article; zbMATH DE number 515723
• On the complexity of realization of the universal function by circuits of functional elements
• scientific article; zbMATH DE number 4049055
• Universal Turing machines with complexity constraint
• Modelling sequential circuits with cellular automata
• scientific article; zbMATH DE number 1059244
• Building a model of a useful Turing machine
• Simulation of Turing machine with uEAC-computable functions

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3607492 (Why is no real title available?)
• Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines)

Cited in

(1)

• Modeling non-branching programs with conditional stopping on a universal Turing machine

This page was built for publication: Simulation of circuits of functional elements by the universal Turing machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4825179)