non-deterministic Turing machine ingelesa (Q1190223)

Wikidatatik
Nabigaziora joan Bilaketara joan
may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol ingelesa
aldatu
Hizkuntza Etiketa Deskribapena Goitizenak
euskara
Ez da etiketarik zehaztu
Ez da deskribapenik zehaztu
    ingelesa
    non-deterministic Turing machine
    may have a set of rules that prescribes more than one action for a given situation; state and tape symbol no longer uniquely specify things; rather, many different actions may apply for the same combination of state and symbol
    • NTM
    • nondeterministic Turing machine

    Adierazpenak

    Identifikatzaileak