Optimal On-Line Simulations of Tree Machines by Random Access Machines

DOI10.1137/0221056MaRDI QIDQ4015977zbMATH OpenOpenAlexFDO

Authors David R. Luginbuhl, Michael C. Loui

Publication date 6 December 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0221056

zbMATH Keywords

on-line simulationrandom access machinereal-time simulationtree machine

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• The complexity of on-line simulations between multidimensional turing machines and random access machines
• Minimizing access pointers into trees and arrays
• Fast Simulation of Turing Machines by Random Access Machines
• On time versus space III
• Fast probabilistic RAM simulation of single tape turing machine computations

Cited in

(5)

• Well-partitioned chordal graphs
• Three problems on well-partitioned chordal graphs
• On Efficient Simulations of Systolic Arrays by Random-Access Machines
• The complexity of on-line simulations between multidimensional turing machines and random access machines
• Linear speed-up does not hold on Turing machines with tree storages

This page was built for publication: Optimal On-Line Simulations of Tree Machines by Random Access Machines

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