|
gptkbp:instance_of
|
gptkb:machinery
|
|
gptkbp:accepts
|
multiple inputs
|
|
gptkbp:analyzes
|
state transition diagram
|
|
gptkbp:can
|
multiple transitions
|
|
gptkbp:can_be_implemented_as
|
software simulation
|
|
gptkbp:can_create
|
non-deterministic algorithms
|
|
gptkbp:can_transform_into
|
equivalent deterministic machine
|
|
gptkbp:emulation
|
gptkb:Quantum_Computing
deterministic Turing machine
|
|
gptkbp:has_function
|
accept or reject
|
|
gptkbp:has_membership
|
multiple states
|
|
gptkbp:has_type
|
gptkb:Model
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
non-deterministic Turing machine
|
|
gptkbp:introduced_in
|
gptkb:Alan_Turing
|
|
gptkbp:is_a
|
gptkb:Model
gptkb:machinery
|
|
gptkbp:is_a_solution_for
|
decision problems
|
|
gptkbp:is_analyzed_in
|
complexity classes
theory of algorithms
|
|
gptkbp:is_applied_in
|
problem-solving
|
|
gptkbp:is_characterized_by
|
non-determinism
|
|
gptkbp:is_compared_to
|
gptkb:P_vs_NP_problem
finite automaton
deterministic Turing machine
|
|
gptkbp:is_considered
|
algorithmic complexity
algorithmic theory
|
|
gptkbp:is_defined_by
|
transition function
|
|
gptkbp:is_described_as
|
gptkb:Logic
|
|
gptkbp:is_explored_in
|
mathematical logic
computational models
|
|
gptkbp:is_fundamental_to
|
theory of computation
|
|
gptkbp:is_part_of
|
theoretical computer science
computational theory
|
|
gptkbp:is_related_to
|
gptkb:NP-completeness
complexity theory
P= NP question
|
|
gptkbp:is_represented_in
|
gptkb:Logic
state diagram
|
|
gptkbp:is_studied_in
|
gptkb:computer_science
|
|
gptkbp:is_used_in
|
formal verification
algorithm design
theoretical analysis
computability theory
|
|
gptkbp:is_used_to
|
analyze algorithms
model computation
demonstrate computational power
prove computational limits
study computation
|
|
gptkbp:scientific_classification
|
non-deterministic model
|
|
gptkbp:bfsParent
|
gptkb:Turing_Machine
gptkb:machinery
|
|
gptkbp:bfsLayer
|
4
|