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

MaRDI QIDQ3115632zbMATH OpenFDO

Authors A. V. Chashkin

Publication date 10 February 2012

zbMATH Keywords

Boolean functionTuring machine

Mathematics Subject Classification ID

Recommendations

• Simulation of circuits of functional elements by the universal Turing machine
• Turing machine and its symbolic simulation
• scientific article; zbMATH DE number 1396672
• scientific article; zbMATH DE number 3997169
• Universal Turing machines with complexity constraint

Cited in

(4)

• An upper bound for the relative influence of variables on Boolean functions
• Halting time is predictable for large models: a universality property and average-case analysis
• scientific article; zbMATH DE number 1542874 (Why is no real title available?)
• scientific article; zbMATH DE number 1418489 (Why is no real title available?)

This page was built for publication: Modeling non-branching programs with conditional stopping on a universal Turing machine

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