scientific article; zbMATH DE number 1396672

zbMATH Open0931.68041MaRDI QIDQ4936630

A. V. Chashkin

Publication date: 31 January 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitycircuitTuring machineBoolean functionsimulation of combinatorial circuits

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Turing machines and related notions (03D10)

Related Items (5)

Simulation of circuits of functional elements by the universal Turing machine ⋮ Generalized ternary simulation of sequential circuits ⋮ Elementary gates for cartoon computation ⋮ A Coinductive Animation of Turing Machines ⋮ Unnamed Item

Recommendations

• Simulation of Turing machines by a regular rewrite rule 👍 👎
• Simulation of Turing machine with uEAC-computable functions 👍 👎
• Simulating Turing machines on Maurer machines 👍 👎
• Fast Simulation of Turing Machines by Random Access Machines 👍 👎
• Simulation of Turing machines by a left-linear rewrite rule 👍 👎
• Deterministic simulation of non-deterministic turing machines (Detailed Abstract) 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎

This page was built for publication: