HTML Microdata document

This HTML5 document contains 136 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

Prefix	IRI
dbpedia-de	http://de.dbpedia.org/resource/
dcterms	http://purl.org/dc/terms/
yago-res	http://yago-knowledge.org/resource/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
dbpedia-ko	http://ko.dbpedia.org/resource/
dbpedia-ca	http://ca.dbpedia.org/resource/
n23	https://books.google.com/
dbpedia-es	http://es.dbpedia.org/resource/
n20	https://global.dbpedia.org/id/
yago	http://dbpedia.org/class/yago/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
dbpedia-hr	http://hr.dbpedia.org/resource/
freebase	http://rdf.freebase.com/ns/
dbpedia-pt	http://pt.dbpedia.org/resource/
dbpedia-fa	http://fa.dbpedia.org/resource/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbpedia-fr	http://fr.dbpedia.org/resource/
dbpedia-zh	http://zh.dbpedia.org/resource/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
gold	http://purl.org/linguistics/gold/
dbr	http://dbpedia.org/resource/
dbpedia-ja	http://ja.dbpedia.org/resource/

Statements

Subject Item: dbr:List_of_complexity_classes
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:List_of_computability_and_complexity_topics
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Atime
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Double_exponential_function
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Presburger_arithmetic
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:NC_(complexity)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:LH_(complexity)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Alternating_turing_machine
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:wikiPageRedirects: dbr:Alternating_Turing_machine

Subject Item: dbr:Computational_complexity_theory
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:PH_(complexity)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:P_(complexity)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Larry_Stockmeyer
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Alternation_(complexity)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:wikiPageRedirects: dbr:Alternating_Turing_machine

Subject Item: dbr:EXPTIME
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Alternating_Turing_machine
rdf:type: yago:Whole100003553 yago:CausalAgent100007347 yago:Model110324560 yago:YagoLegalActor yago:YagoLegalActorGeo yago:WikicatModelsOfComputation yago:Worker109632518 yago:Object100002684 dbo:Software yago:Assistant109815790 yago:Organism100004475 yago:PhysicalEntity100001930 yago:Person100007846 yago:LivingThing100004258
rdfs:label: Màquina de Turing alternant Machine de Turing alternante Máquina de Turing alternada 交替式图灵机 Máquina de Turing alternante Alternating Turing machine 交替性チューリング機械 Alternierende Turingmaschine 교대 튜링 기계
rdfs:comment: En informatique théorique, et notamment en théorie de la complexité, les machines de Turing alternantes sont une généralisation des machines de Turing non déterministes. Leur mode d'acceptation généralise les conditions d'acceptation utilisées dans les classes de complexité NP et co-NP. Le concept de machine de Turing alternante a été formulé par Ashok K. Chandra et Larry Stockmeyer et indépendamment par Dexter Kozen en 1976, avec un article publié en commun en 1981. Chandra et Stockmeyer les utilisent pour démontrer des bornes inférieures en temps exponentiel pour des jeux à deux joueurs. Les machines alternantes donnent une autre interprétation de la hiérarchie polynomiale. In der theoretischen Informatik ist eine alternierende Turingmaschine (ATM) eine nichtdeterministische Turingmaschine, welche die üblichen Regeln für die Akzeptanz einer Eingabe erweitert. Dabei werden die Zustände der Maschine in existentielle und universelle Zustände aufgeteilt. Erste akzeptieren eine Eingabe, wenn es eine mögliche Berechnung gibt, die akzeptiert, während zweite nur dann akzeptieren, wenn alle möglichen Berechnung akzeptieren. 交替式图灵机（英語：Alternating Turing Machine, ATM）是计算复杂度理论中定义的一种非确定型图灵机（NTM）。与一般非确定型图灵机不同，交替式图灵机将接受语言的规则一般化到NP和反NP。交替式图灵机的概念由Chandra和于1976年提出。交替性チューリング機械（こうたいせいチューリングきかい、英: Alternating Turing Machine, ATM）は、非決定性チューリング機械 (NTM) の一種であり、複雑性クラス NP および co-NP の定義で使われる規則を一般化した計算受理規則を持つ。1976年、Chandra と Stockmeyer が ATM の概念を定式化した。 Em complexidade de computação teórica, uma máquina de Turing alternada (MTA) é uma máquina de Turing não-determinística (MTN) com a regra que aceita computações que generalizam regras usadas na definição da complexidade das classes NP e co-NP. O conceito de uma ATM foi criado por Chandra e Stockmeyer e independentemente por Kozen em 1976 (veja as referências). En la teoría de la complejidad computacional, una máquina de Turing alternante (ATM) es una (NTM) con una regla para la aceptación de cómputos que generaliza las reglas usadas en la definición de las clases de complejidad NP y co-NP. El concepto de una ATM fue establecido por Chandra y en 1976 (ver referencias). In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer and independently by Kozen in 1976, with a joint journal publication in 1981. 교대 튜링 기계(Alternating Turing machine, ATM)는 비결정론적 튜링 기계에 몇가지 조건이 추가된 기계이다. En teoria de la computació, una Màquina de Turing alternant (ATM) és una màquina de Turing no determinista amb una regla per acceptar computacions que generalitzen les regles usades en la definició de les classes de complexitat NP i co-NP.
dcterms:subject: dbc:Models_of_computation
dbo:wikiPageID: 753230
dbo:wikiPageRevisionID: 1072613732
dbo:wikiPageWikiLink: dbr:P_(complexity) dbr:Space_constructible dbr:Complexity_class dbr:Parallel_computation_thesis dbr:Immerman–Szelepcsényi_theorem dbr:Complexity_classes dbr:Formal_language dbr:Tuple dbr:PSPACE dbc:Models_of_computation dbr:Computational_complexity_theory dbr:Dexter_Kozen dbr:EXPSPACE dbr:Polynomial_hierarchy dbr:LH_(complexity) dbr:Circuit_minimization_problem dbr:Boolean_function dbr:Boolean_satisfiability_problem dbr:Co-NP dbr:Ashok_K._Chandra dbr:NP_(complexity) dbr:EXPTIME dbr:Larry_Stockmeyer dbr:Quantified_Boolean_formula_problem dbr:Non-deterministic_Turing_machine
dbo:wikiPageExternalLink: n23:books%3Fid=wR_oBwAAQBAJ%7Cyear
owl:sameAs: dbpedia-zh:交替式图灵机 freebase:m.038ft3 yago-res:Alternating_Turing_machine dbpedia-pt:Máquina_de_Turing_alternada dbpedia-hr:Alternirajući_Turingov_stroj dbpedia-de:Alternierende_Turingmaschine dbpedia-fa:ماشین_تورینگ_متناوب wikidata:Q438833 n20:44DBs dbpedia-ja:交替性チューリング機械 dbpedia-ko:교대_튜링_기계 dbpedia-ca:Màquina_de_Turing_alternant dbpedia-fr:Machine_de_Turing_alternante dbpedia-es:Máquina_de_Turing_alternante
dbp:wikiPageUsesTemplate: dbt:More_footnotes dbt:Short_description dbt:Cite_book dbt:Null dbt:Unreferenced_section dbt:Turing dbt:Mvar dbt:Reflist dbt:Citation_needed
dbo:abstract: 交替式图灵机（英語：Alternating Turing Machine, ATM）是计算复杂度理论中定义的一种非确定型图灵机（NTM）。与一般非确定型图灵机不同，交替式图灵机将接受语言的规则一般化到NP和反NP。交替式图灵机的概念由Chandra和于1976年提出。 En la teoría de la complejidad computacional, una máquina de Turing alternante (ATM) es una (NTM) con una regla para la aceptación de cómputos que generaliza las reglas usadas en la definición de las clases de complejidad NP y co-NP. El concepto de una ATM fue establecido por Chandra y en 1976 (ver referencias). 交替性チューリング機械（こうたいせいチューリングきかい、英: Alternating Turing Machine, ATM）は、非決定性チューリング機械 (NTM) の一種であり、複雑性クラス NP および co-NP の定義で使われる規則を一般化した計算受理規則を持つ。1976年、Chandra と Stockmeyer が ATM の概念を定式化した。 Em complexidade de computação teórica, uma máquina de Turing alternada (MTA) é uma máquina de Turing não-determinística (MTN) com a regra que aceita computações que generalizam regras usadas na definição da complexidade das classes NP e co-NP. O conceito de uma ATM foi criado por Chandra e Stockmeyer e independentemente por Kozen em 1976 (veja as referências). In computational complexity theory, an alternating Turing machine (ATM) is a non-deterministic Turing machine (NTM) with a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. The concept of an ATM was set forth by Chandra and Stockmeyer and independently by Kozen in 1976, with a joint journal publication in 1981. En informatique théorique, et notamment en théorie de la complexité, les machines de Turing alternantes sont une généralisation des machines de Turing non déterministes. Leur mode d'acceptation généralise les conditions d'acceptation utilisées dans les classes de complexité NP et co-NP. Le concept de machine de Turing alternante a été formulé par Ashok K. Chandra et Larry Stockmeyer et indépendamment par Dexter Kozen en 1976, avec un article publié en commun en 1981. Chandra et Stockmeyer les utilisent pour démontrer des bornes inférieures en temps exponentiel pour des jeux à deux joueurs. Les machines alternantes donnent une autre interprétation de la hiérarchie polynomiale. In der theoretischen Informatik ist eine alternierende Turingmaschine (ATM) eine nichtdeterministische Turingmaschine, welche die üblichen Regeln für die Akzeptanz einer Eingabe erweitert. Dabei werden die Zustände der Maschine in existentielle und universelle Zustände aufgeteilt. Erste akzeptieren eine Eingabe, wenn es eine mögliche Berechnung gibt, die akzeptiert, während zweite nur dann akzeptieren, wenn alle möglichen Berechnung akzeptieren. En teoria de la computació, una Màquina de Turing alternant (ATM) és una màquina de Turing no determinista amb una regla per acceptar computacions que generalitzen les regles usades en la definició de les classes de complexitat NP i co-NP. 교대 튜링 기계(Alternating Turing machine, ATM)는 비결정론적 튜링 기계에 몇가지 조건이 추가된 기계이다.
gold:hypernym: dbr:Machine
prov:wasDerivedFrom: wikipedia-en:Alternating_Turing_machine?oldid=1072613732&ns=0
dbo:wikiPageLength: 12424
foaf:isPrimaryTopicOf: wikipedia-en:Alternating_Turing_machine

Subject Item: dbr:PSPACE
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:2-EXPTIME
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:ATM
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:wikiPageDisambiguates: dbr:Alternating_Turing_machine

Subject Item: dbr:Ashok_K._Chandra
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:knownFor: dbr:Alternating_Turing_machine

Subject Item: dbr:AC_(complexity)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Polynomial_hierarchy
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Universal_Turing_machine
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Universal_state_(Turing)
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:wikiPageRedirects: dbr:Alternating_Turing_machine

Subject Item: dbr:Exponential_hierarchy
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Immerman–Szelepcsényi_theorem
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:List_of_terms_relating_to_algorithms_and_data_structures
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:List_of_things_named_after_Alan_Turing
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Multitape_Turing_machine
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Parallel_computation_thesis
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:True_quantified_Boolean_formula
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine

Subject Item: dbr:Alternating_computation
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:wikiPageRedirects: dbr:Alternating_Turing_machine

Subject Item: dbr:Existential_state
dbo:wikiPageWikiLink: dbr:Alternating_Turing_machine
dbo:wikiPageRedirects: dbr:Alternating_Turing_machine

Subject Item: wikipedia-en:Alternating_Turing_machine
foaf:primaryTopic: dbr:Alternating_Turing_machine