Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Time complexity of multidimensional Turing machines

From MaRDI portal
Publication:1168311
Jump to:navigation, search

DOI10.1007/BF01629436zbMath0493.03015MaRDI QIDQ1168311

Dima Yu. Grigoriev

Publication date: 1982

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


zbMATH Keywords

random access machinesnondeterministic Turing machinerecognition of predicatessimulating multidimensional multi-head Turing machinestime-bound


Mathematics Subject Classification ID

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




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Zwei-Band Simulation von Turingmaschinen. (Two-tape simulation of Turing machines)
  • Tape bounds for time-bounded Turing machines
  • On Time Versus Space
  • On-Line Turing Machine Computations




This page was built for publication: Time complexity of multidimensional Turing machines

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1168311&oldid=13236317"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:00.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki