On efficient simulations of multicounter machines

DOI10.1016/S0019-9958(82)90363-1zbMATH Open0539.68041MaRDI QIDQ3326841

Paul M. B. Vitányi

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

VLSIon-line simulationcounter machinecyclic networkscosts of combinational logic networksmulticounter machineoblivious Turing machinesimulation by RAM's

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Linear-time simulation of multihead Turing machines 👍 👎
• SIMULATIONS BY TIME-BOUNDED COUNTER MACHINES 👍 👎
• Simulations by Time-Bounded Counter Machines 👍 👎
• An Optimal Simulation of Counter Machines 👍 👎
• An Optimal Simulation of Counter Machines: The ACM Case 👍 👎
• On efficient deterministic simulation of turing machine computations below logaspace 👍 👎
• Fast Simulation of Turing Machines by Random Access Machines 👍 👎
• Exact and efficient simulation of concordant computation 👍 👎
• Efficient Simulations by Queue Machines 👍 👎

This page was built for publication: On efficient simulations of multicounter machines

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