On efficient simulations of multicounter machines

DOI10.1016/S0019-9958(82)90363-1MaRDI QIDQ3326841zbMATH OpenFDO

Authors Paul M. B. Vitányi

Publication date 1982

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

Full work available at URL https://doi.org/10.1016/S0019-9958(82)90363-1

zbMATH Keywords

costs of combinational logic networkscounter machinecyclic networksmulticounter machineoblivious Turing machineon-line simulationsimulation by RAM'sVLSI

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• An Optimal Simulation of Counter Machines
• An Optimal Simulation of Counter Machines: The ACM Case
• Simulations by time-bounded counter machines
• Simulations by Time-Bounded Counter Machines
• Efficient Simulations by Queue Machines
• Linear-time simulation of multihead Turing machines
• Exact and efficient simulation of concordant computation
• scientific article; zbMATH DE number 3949715
• On efficient deterministic simulation of turing machine computations below logaspace
• Fast Simulation of Turing Machines by Random Access Machines

Cited in

(6)

• On the simulation of many storage heads by one
• 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
• scientific article; zbMATH DE number 3986645 (Why is no real title available?)

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)