Sign inSign in

Non-deterministic machine computing a function

An NTM computes a function if on every input, all branches either output the correct value or reject, and at least one branch does not reject.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Non-deterministic Turing machine1Turing machine computation1

Lecturers

1

    Connections

    2

    The lectures that define it or assume it, and the concepts next to it.

    Concept1

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.