alternating Turing machines

URI: https://gptkb.org/entity/alternating_Turing_machines
GPTKB entity
Statements (28)
Predicate Object
gptkbp:instanceOf gptkb:theoretical_computer_science
gptkbp:abbreviation gptkb:ATM
gptkbp:acceptsInputIf all computation paths accept (universal)
there exists a computation tree with an accepting path (existential)
gptkbp:characterizesComplexityClass gptkb:PSPACE
AP (alternating polynomial time)
gptkbp:complexity gptkb:AP
gptkb:AL
gptkbp:definedIn polynomial hierarchy
alternating space complexity classes
gptkbp:describedBy gptkb:Journal_of_the_ACM
gptkbp:generalizes deterministic Turing machines
nondeterministic Turing machines
gptkbp:hasKeyProperty can alternate between existential and universal states
gptkbp:hasStateType existential state
universal state
gptkbp:introduced gptkb:Dexter_Kozen
Ashok K. Chandra
Larry J. Stockmeyer
gptkbp:introducedIn 1976
gptkbp:relatedTo gptkb:quantified_Boolean_formula
parallel computation
Boolean circuit complexity
gptkbp:studiedIn gptkb:theoretical_computer_science
gptkbp:usedIn gptkb:complexity_theory
gptkbp:bfsParent gptkb:Larry_Stockmeyer
gptkbp:bfsLayer 6
https://www.w3.org/2000/01/rdf-schema#label alternating Turing machines