Theorems on the time hierarchy for random access machines

DOI10.1007/BF01629438zbMath0493.03013MaRDI QIDQ1168309

A. G. Ivanov

Publication date: 1982

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

zbMATH Keywords

random access machinesregister length restrictionsrun times for recognizing sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10)

Cites Work

• Time bounded random access machines
• Unnamed Item
• Unnamed Item

This page was built for publication: Theorems on the time hierarchy for random access machines