About: Random-access Turing machine

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In computational complexity, a field of computer science, random-access Turing machines are an extension of Turing machines used to speak about small complexity classes, especially for classes using logarithmic time, like DLOGTIME and the logarithmic hierarchy.

Property Value
dbo:abstract
  • In computational complexity, a field of computer science, random-access Turing machines are an extension of Turing machines used to speak about small complexity classes, especially for classes using logarithmic time, like DLOGTIME and the logarithmic hierarchy. (en)
  • 在計算複雜性理論內，隨機存取圖靈機(random-access Turing machines)是一種變版的圖靈機，用來處理大小較小的複雜度類，特別是使用對數時間的複雜度類，像是DLOGTIME以及。 (zh)
dbo:wikiPageID
  • 27997978 (xsd:integer)
dbo:wikiPageLength
  • 1148 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1025481195 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In computational complexity, a field of computer science, random-access Turing machines are an extension of Turing machines used to speak about small complexity classes, especially for classes using logarithmic time, like DLOGTIME and the logarithmic hierarchy. (en)
  • 在計算複雜性理論內，隨機存取圖靈機(random-access Turing machines)是一種變版的圖靈機，用來處理大小較小的複雜度類，特別是使用對數時間的複雜度類，像是DLOGTIME以及。 (zh)
rdfs:label
  • Random-access Turing machine (en)
  • 隨機存取圖靈機 (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License