| http://dbpedia.org/ontology/abstract
|
In computational complexity, a field of co … 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.ke DLOGTIME and the logarithmic hierarchy.
, 在計算複雜性理論內，隨機存取圖靈機(random-access Turing machines)是一種變版的圖靈機，用來處理大小較小的複雜度類，特別是使用對數時間的複雜度類，像是DLOGTIME以及。
|
| http://dbpedia.org/ontology/wikiPageID
|
27997978
|
| http://dbpedia.org/ontology/wikiPageLength
|
1148
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1025481195
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Category:Complexity_classes +
, http://dbpedia.org/resource/DLOGTIME +
, http://dbpedia.org/resource/Descriptive_Complexity +
, http://dbpedia.org/resource/Pointer_%28computing%29 +
, http://dbpedia.org/resource/LH_%28complexity%29 +
, http://dbpedia.org/resource/Time_complexity +
, http://dbpedia.org/resource/Turing_machine +
, http://dbpedia.org/resource/Linear_time +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Neil_Immerman +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Refimprove +
, http://dbpedia.org/resource/Template:Comp-sci-theory-stub +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Complexity_classes +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Extension +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Random-access_Turing_machine?oldid=1025481195&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Random-access_Turing_machine +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q7291905 +
, https://global.dbpedia.org/id/4tWTi +
, http://rdf.freebase.com/ns/m.0ch2stp +
, http://dbpedia.org/resource/Random-access_Turing_machine +
, http://zh.dbpedia.org/resource/%E9%9A%A8%E6%A9%9F%E5%AD%98%E5%8F%96%E5%9C%96%E9%9D%88%E6%A9%9F +
, http://yago-knowledge.org/resource/Random-access_Turing_machine +
|
| rdf:type |
http://dbpedia.org/ontology/Software +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Class107997703 +
, http://dbpedia.org/class/yago/WikicatComplexityClasses +
, http://dbpedia.org/class/yago/Collection107951464 +
, http://dbpedia.org/class/yago/Group100031264 +
|
| rdfs:comment |
In computational complexity, a field of co … 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.ke DLOGTIME and the logarithmic hierarchy.
, 在計算複雜性理論內，隨機存取圖靈機(random-access Turing machines)是一種變版的圖靈機，用來處理大小較小的複雜度類，特別是使用對數時間的複雜度類，像是DLOGTIME以及。
|
| rdfs:label |
Random-access Turing machine
, 隨機存取圖靈機
|
